603 search results - page 9 / 121 » DFS-Tree Based Heuristic Search |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
ICGI
2004
Springer
14 years 1 months ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
OR
2007
Springer
13 years 7 months ago
2007
Springer
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...