We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...