Have a personal or library account? Click to login
Accelerating backtrack search with a best-first-search strategy Cover

Accelerating backtrack search with a best-first-search strategy

International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 4 (December 2014)
By: Zoltán Ádám Mann and  Tamás Szép  
Open Access
|Dec 2014

Authors

Zoltán Ádám Mann

zoltan.mann@gmail.com

Tamás Szép

szep.tamas.89@gmail.com

DOI: https://doi.org/10.2478/amcs-2014-0066 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 901 - 916
Submitted on: Feb 2, 2014
|
Published on: Dec 20, 2014
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
best-first search,
backtrack,
branch-and-bound,
constraint satisfaction problem,
frequent restarting
Related subjects:
Mathematics,
Applied mathematics

© 2014 Zoltán Ádám Mann, Tamás Szép, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 24 (2014): Issue 4 (December 2014)Next article