520 search results - page 16 / 104 » New Complexity Results for Classical Planning Benchmarks |
AAAI
2008
13 years 9 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
COMPULOG
1999
Springer
13 years 11 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Despite the large body of work in both motion planning and multi-agent simulation, little work has focused on the problem of planning motion for groups of robots using external...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
The invariance of the similarity measure in photometric distortions as well as its capability in producing subpixel accuracy are two desired and often required features in most st...