Predicting the size of IDA\(^*\)'s search tree

DOI10.1016/j.artint.2013.01.001zbMath1270.68274OpenAlexW2103049742MaRDI QIDQ360040

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

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)

Related Items (5)

Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Probably bounded suboptimal heuristic search

This page was built for publication: Predicting the size of IDA\(^*\)'s search tree