99 search results - page 17 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The mapping and localization problems have received considerable attention in robotics recently. The exploration problem that drives mapping has started to generate sim...
CP
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
FSR
2005
Springer
14 years 1 months ago
2005
Springer
In the near future, off-road mobile robots will feature high levels of autonomy which will render them useful for a variety of tasks on Earth and other planets. Many terrestrial a...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...