99 search results - page 3 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
AIPS
2009
13 years 7 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
AIPS
2009
13 years 7 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
SAS
2009
Springer
14 years 6 months ago
2009
Springer
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
AIPS
2010
13 years 8 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...