59 search results - page 9 / 12 » aips 2006 |
86
Voted
AIPS
2006
15 years 1 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
116
click to vote
AIPS
2006
15 years 1 months ago
2006
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
126
Voted
AIPS
2006
15 years 1 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
AIPS
2006
15 years 1 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
57
Voted
AIPS
2006
15 years 1 months ago
2006
We describe a domain-independent framework for plan summarization and comparison that can help a human understand both the key elements of an individual plan and important differe...