Szukana fraza: [Abstract = "In this paper, we propose a more sophisticated approach\: a best\-first\-search heuristic to quickly move between parts of the search space, always concentrating on the most promising region. We describe how this idea can be efficiently incorporated into a backtrack search algorithm, without sacrificing optimality. Moreover, we demonstrate empirically that, for hard solvable problem instances, the new approach provides significantly higher speed\-up than frequent restarting."]

Wyników: 1