520 search results - page 14 / 104 » New Complexity Results for Classical Planning Benchmarks |
126
click to vote
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
77
Voted
AAAI
2006
15 years 1 months ago
2006
Automated domain factoring, and planning methods that utilize them, have long been of interest to planning researchers. Recent work in this area yielded new theoretical insight an...
90
Voted
AI
2005
Springer
15 years 6 months ago
2005
Springer
The AAAI Mobile Robot Challenge requires robots to start from the entrance of the conference site, find their own way to the registration desk, socially interact with people and p...
AAAI
1998
15 years 1 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
79
Voted
DGCI
2000
Springer
15 years 4 months ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...