Knowledge versus search: A quantitative analysis using A∗
- 31 January 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 20 (1) , 1-13
- https://doi.org/10.1016/0004-3702(83)90013-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Probabilistic analysis of the complexity ofArtificial Intelligence, 1980
- Depth-m search in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1978
- 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
- The heuristic search under conditions of errorArtificial Intelligence, 1974
- An admissible and optimal algorithm for searching AND/OR graphsArtificial Intelligence, 1971
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968