Performance of linear-space search algorithms
- 1 December 1995
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 79 (2) , 241-292
- https://doi.org/10.1016/0004-3702(94)00047-6
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Linear-space best-first searchArtificial Intelligence, 1993
- Iterative broadeningArtificial Intelligence, 1992
- Reducing reexpansions in iterative-deepening search by controlling cutoff boundsArtificial Intelligence, 1991
- Heuristic search in restricted memoryArtificial Intelligence, 1989
- Combinatorial Optimization: Algorithms and Complexity.The American Mathematical Monthly, 1984
- Random Trees and the Analysis of Branch and Bound ProceduresJournal of the ACM, 1984
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Searching for an optimal path in a tree with random costsArtificial Intelligence, 1983
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974
- A note on two problems in connexion with graphsNumerische Mathematik, 1959