Accelerating backtrack search with a best-first-search strategy

Publicado en línea: 20 dic 2014

Páginas: 901 - 916

Recibido: 02 feb 2014

DOI: https://doi.org/10.2478/amcs-2014-0066

Palabras clave

best-first search, backtrack, branch-and-bound, constraint satisfaction problem, frequent restarting

© by Zoltán Ádám Mann

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.