66 search results - page 3 / 14 » Using Caching to Solve Larger Probabilistic Planning Problem... |
AIPS
2006
13 years 7 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
SBRN
2008
IEEE
14 years 5 days ago
2008
IEEE
The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
HPCN
1995
Springer
13 years 9 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...