Superlinear speedup in parallel state-space search
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 161-174
- https://doi.org/10.1007/3-540-50517-2_79
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Performance of an OR-parallel logic programming systemInternational Journal of Parallel Programming, 1988
- Parallel depth first search. Part II. AnalysisInternational Journal of Parallel Programming, 1987
- Parallel depth first search. Part I. ImplementationInternational Journal of Parallel Programming, 1987
- Coping with Anomalies in Parallel Branch-and-Bound AlgorithmsIEEE Transactions on Computers, 1986
- The average complexity of depth-first search with backtracking and cutoffIBM Journal of Research and Development, 1986
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Parallel Branch-and-Bound Formulations for AND/OR Tree SearchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- General Branch and Bound, and its relation to A∗ and AO∗Artificial Intelligence, 1984
- A Study in Parallel Computation - The Traveling Salesman ProblemPublished by Defense Technical Information Center (DTIC) ,1982