Predicting the size of IDA^*'s search tree
From MaRDI portal
Publication:360040
DOI10.1016/J.ARTINT.2013.01.001zbMATH Open1270.68274OpenAlexW2103049742MaRDI QIDQ360040FDOQ360040
Authors: Levi H. S. Lelis, Sandra Zilles, Robert C. Holte Error creating thumbnail:
Publication date: 23 August 2013
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370213000039
Recommendations
Cited In (8)
- Iterative-deepening search with on-line tree size prediction
- Rational deployment of multiple heuristics in optimal state-space search
- Potential-based bounded-cost search and anytime non-parametric A*
- Title not available (Why is that?)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Probably bounded suboptimal heuristic search
- Predicting optimal solution cost with conditional probabilities
- Predicting the performance of IDA\(^*\) using conditional distributions
This page was built for publication: Predicting the size of IDA\(^*\)'s search tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360040)