Evaluation of a simple, scalable, parallel best-first search strategy
- 1 February 2013
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 195, 222-248
Abstract
No abstract availableKeywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Linear-time disk-based implicit graph searchJournal of the ACM, 2008
- Parallel planning via the distribution of operatorsJournal of Experimental & Theoretical Artificial Intelligence, 2001
- Scalable global and local hashing strategies for duplicate pruning in parallel A* graph searchIEEE Transactions on Parallel and Distributed Systems, 1997
- Randomized parallel algorithms for backtrack search and branch-and-bound computationJournal of the ACM, 1993
- A SIMD approach to parallel heuristic searchArtificial Intelligence, 1993
- Depth-first heuristic search on a SIMD machineArtificial Intelligence, 1993
- Single-agent parallel window searchIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Heuristic search in restricted memoryArtificial Intelligence, 1989
- Parallel depth first search. Part I. ImplementationInternational Journal of Parallel Programming, 1987
- Algorithms for distributed termination detectionDistributed Computing, 1987