23 search results - page 2 / 5 » Learning Inadmissible Heuristics During Search |
JAIR
2007
13 years 7 months ago
2007
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macro...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
SAT
2004
Springer
14 years 22 days ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
ICCBR
2007
Springer
14 years 1 months ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...