4 search results - page 1 / 1 » On the Decomposition and Concurrent Resolution of a Planning... |
PUK
2003
13 years 6 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
AIPS
1994
13 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
CSCLP
2007
Springer
13 years 11 months ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
DATE
2002
IEEE
13 years 9 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...