Time complexity of iterative-deepening-A∗
- 30 June 2001
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 129 (1-2), 199-218
- https://doi.org/10.1016/s0004-3702(01)00094-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Pattern DatabasesComputational Intelligence, 1998
- Depth-first iterative-deepening: An optimal admissible tree searchArtificial Intelligence, 1985
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968