206 search results - page 8 / 42 » Learning Heuristic Functions from Relaxed Plans |
CP
2007
Springer
15 years 4 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
BIBM
2007
IEEE
15 years 4 months ago
2007
IEEE
Prediction of gene functions is a major challenge to biologists in the post-genomic era. Interactions between genes and their products compose networks and can be used to infer ge...
APIN
2004
14 years 9 months ago
2004
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...
AIPS
2009
14 years 11 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...