Abstract
This work presents a skeleton for the A*heuristic search. This skeleton provides to the user a sequential solver and a parallel solver based in the shared memory paradigm. The user interface for the specification of the necessary classes and methods to solve an specific problem is described. Also the internal operation mode of the two solvers is showed in detail. Computational results obtained on a multiprocessor machine for the Two-Dimensional Cutting Stock Problem are presented. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Miranda, G., & León, C. (2005). An openMP skeleton for the A* heuristic search*. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 717–722). Springer Verlag. https://doi.org/10.1007/11557654_82
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
