Predicting the size of IDA^*'s search tree

DOI10.1016/J.ARTINT.2013.01.001MaRDI QIDQ360040zbMATH OpenOpenAlexFDO

Authors Levi H. S. Lelis, Sandra Zilles, Robert C. Holte

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Predicting the performance of IDA\(^*\) using conditional distributions
• scientific article; zbMATH DE number 1882049
• Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
• Iterative-deepening search with on-line tree size prediction
• On the asymptotic performance of IDA

Cited in

(8)

• Predicting the performance of IDA\(^*\) using conditional distributions
• 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*
• scientific article; zbMATH DE number 1882049 (Why is no real title available?)
• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
• Probably bounded suboptimal heuristic search
• Predicting optimal solution cost with conditional probabilities

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)