Accelerating backtrack search with a best-first-search strategy
International Journal of Applied Mathematics and Computer Science (2014)
- Volume: 24, Issue: 4, page 901-916
- ISSN: 1641-876X
Access Full Article
topHow to cite
topZoltán Ádám Mann, and Tamás Szép. "Accelerating backtrack search with a best-first-search strategy." International Journal of Applied Mathematics and Computer Science 24.4 (2014): 901-916. <http://eudml.org/doc/271867>.
@article{ZoltánÁdámMann2014,
author = {Zoltán Ádám Mann, Tamás Szép},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {best-first search; backtrack; branch-and-bound; constraint satisfaction problem; frequent restarting; NP-hard problems},
language = {eng},
number = {4},
pages = {901-916},
publisher = {University of Zielona Gora Press},
title = {Accelerating backtrack search with a best-first-search strategy},
url = {http://eudml.org/doc/271867},
volume = {24},
year = {2014},
}
TY - JOUR
AU - Zoltán Ádám Mann
AU - Tamás Szép
TI - Accelerating backtrack search with a best-first-search strategy
JO - International Journal of Applied Mathematics and Computer Science
PY - 2014
PB - University of Zielona Gora Press
VL - 24
IS - 4
SP - 901
EP - 916
LA - eng
KW - best-first search; backtrack; branch-and-bound; constraint satisfaction problem; frequent restarting; NP-hard problems
UR - http://eudml.org/doc/271867
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.