| Document Date: 2006-07-09 01:49:28
Open Document File Size: 302,41 KBShare Result on Facebook
City Reactive Model / Cambridge / / Company McDermott / Temporal Plan Networks / Embedded Software / E S A / D-Kirk / Ford / Boeing / / / Facility Artificial Intelligence Laboratory / Massachusetts Institute of Technology / / IndustryTerm dispatching algorithm / ad-hoc communication network / non-deterministic choice operator / data and processing across available processors / distributed processing / heterogeneous systems / input plan / leader election algorithm / nested choice operator / hierarchical adhoc network / reformulation algorithm / parallel processing / rst search / dynamic simple temporal networks / contingent plan execution systems / systematic search / concurrent processing / search queue / distributed reformulation algorithm / processor network / impoverished processors / parallel algorithm / Temporal constraint networks / produced contingent plan execution systems / / OperatingSystem Microsoft Windows / / Organization Massachusetts Institute of Technology / Artificial Intelligence / RC / Determine / C. Williams Computer Science and Artificial Intelligence Laboratory / Minimal Dispatchable Graph / / Person Inform / Morgan Kaufmann / Brian C. Williams / Stephen A. Block / / Position Dean / leader / executive / distributed executive / leader for Each member node do Form edges / / Product C-1896 / / ProgrammingLanguage RC / / ProvinceOrState British Columbia / Massachusetts / / Technology distributed reformulation algorithm / SSSP algorithm / distribution algorithm / distributed algorithms / dispatching algorithm / exactly one processor / BellmanFord algorithm / distributed / parallel algorithm / relevant processors / leader election algorithm / reformulation algorithm / computationally impoverished processors / distributed algorithm / planning algorithm / parallel processing / reformulated using a distributed / parallel algorithm / /
SocialTag |
Robust Execution of Contingent, Temporally Flexible Plans