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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11557654_82 | HPCC |
Keywords | Field | DocType |
shared memory,user interface,heuristic search,cutting stock problem | Heuristic,Shared memory,Computer science,Parallel algorithm,Parallel computing,Multiprocessing,Cutting stock problem,Solver,Skeleton (computer programming),User interface | Conference |
Volume | ISSN | ISBN |
3726 | 0302-9743 | 3-540-29031-1 |
Citations | PageRank | References |
3 | 0.47 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gara Miranda-valladares | 1 | 4 | 1.17 |
Coromoto León | 2 | 231 | 25.71 |