1589 search results - page 49 / 318 » Multiple-Goal Heuristic Search |
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
ICGI
2004
Springer
14 years 3 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, ...
IJAIT
2002
13 years 9 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
IJCBDD
2008
13 years 10 months ago
2008
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
GIS
2008
ACM
13 years 11 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...