Iterative-deepening search with on-line tree size prediction

DOI10.1007/S10472-013-9347-9MaRDI QIDQ2248554zbMATH OpenOpenAlexFDO

Authors Ethan Burns, Wheeler Ruml

Publication date 26 June 2014

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-013-9347-9

zbMATH Keywords

heuristic searchtree searchreactive searchautonomous searchtree size prediction

Mathematics Subject Classification ID

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

Recommendations

• Depth-first iterative-deepening: An optimal admissible tree search
• Predicting the size of IDA\(^*\)'s search tree
• Effective use of memory in iterative deepening search
• On the asymptotic performance of IDA
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• A heuristic search algorithm with modifiable estimate
• Depth-first iterative-deepening: An optimal admissible tree search
• Frontier search
• Instance-specific algorithm configuration
• Predicting the performance of IDA\(^*\) using conditional distributions
• Reactive search and intelligent optimization
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• SATzilla: portfolio-based algorithm selection for SAT
• Time complexity of iterative-deepening-\(A^{*}\)

Cited in

(7)

• Agent searching in a tree and the optimality of iterative deepening
• Time complexity of iterative-deepening-\(A^{*}\)
• Depth-first iterative-deepening: An optimal admissible tree search
• From feasibility to improvement to proof: three phases of solving mixed-integer programs
• Predicting the size of IDA\(^*\)'s search tree
• Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
• Predicting optimal solution cost with conditional probabilities

Describes a project that uses

Uses Software

• SATzilla

This page was built for publication: Iterative-deepening search with on-line tree size prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248554)