A result on the computational complexity of heuristic estimates for the A∗ algorithm
- 31 October 1984
- journal article
- Published by Elsevier in Information Sciences
- Vol. 34 (1) , 47-59
- https://doi.org/10.1016/0020-0255(84)90009-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The nature of heuristicsArtificial Intelligence, 1982
- Probabilistic analysis of the complexity ofArtificial Intelligence, 1980
- A method for computing heuristics in problem solvingInformation Sciences, 1979
- On the optimality of A∗Artificial Intelligence, 1977
- On the complexity of admissible search algorithmsArtificial Intelligence, 1977
- Problem representations and formal properties of heuristic searchInformation Sciences, 1976
- Heuristically guided search and chromosome matchingArtificial Intelligence, 1970
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959