1615 search results - page 41 / 323 » Pathology in heuristic search |
AIPS
2008
14 years 8 days 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...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
FLAIRS
2008
14 years 8 days ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
AIPS
1994
13 years 11 months ago
1994
When a plan involves hundreds or thousands of events over time it can be di cult or impossible to tell whether those events are unfolding \according to plan" and to assess th...
MTV
2003
IEEE
14 years 3 months ago
2003
IEEE
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...