Iterative-deepening search with on-line tree size prediction
- 10 April 2013
- journal article
- Published by Springer Science and Business Media LLC in Annals of Mathematics and Artificial Intelligence
- Vol. 69 (2), 183-205
- https://doi.org/10.1007/s10472-013-9347-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Continuous Search in Constraint ProgrammingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Reactive Search and Intelligent OptimizationPublished by Springer Science and Business Media LLC ,2009
- SATzilla: Portfolio-based Algorithm Selection for SATJournal of Artificial Intelligence Research, 2008
- Frontier searchJournal of the ACM, 2005
- Time complexity of iterative-deepening-AArtificial Intelligence, 2001
- Pattern DatabasesComputational Intelligence, 1998
- COMPARISON AND EVALUATION OF A CLASS OF IDA* ALGORITHMSInternational Journal on Artificial Intelligence Tools, 1994
- Reducing reexpansions in iterative-deepening search by controlling cutoff boundsArtificial Intelligence, 1991
- A heuristic search algorithm with modifiable estimateArtificial Intelligence, 1984
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968