Accelerating backtrack search with a best-first-search strategy

Data publikacji: 20 gru 2014

Zakres stron: 901 - 916

Otrzymano: 02 lut 2014

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

Słowa kluczowe

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.