408 search results - page 43 / 82 » A lookahead strategy for solving large planning problems |
AIPS
2008
15 years 17 hour ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
79
Voted
ISRR
2001
Springer
15 years 2 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
150
Voted
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We demonstrate the schema and ontology matching tool COMA++. It extends our previous prototype COMA utilizing a composite approach to combine different match algorithms [3]. COMA+...
101
click to vote
SIGMOD
2011
ACM
14 years 15 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
SC
2000
ACM
15 years 2 months ago
2000
ACM
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...