Iterative-deepening search with on-line tree size prediction
From MaRDI portal
Publication:2248554
DOI10.1007/S10472-013-9347-9zbMATH Open1310.68185OpenAlexW2021545912MaRDI QIDQ2248554FDOQ2248554
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reactive search and intelligent optimization
- Depth-first iterative-deepening: An optimal admissible tree search
- A heuristic search algorithm with modifiable estimate
- Frontier search
- Predicting the Performance of IDA* using Conditional Distributions
- Time complexity of iterative-deepening-\(A^{*}\)
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Instance-Specific Algorithm Configuration
Cited In (6)
- Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
- 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
- Predicting optimal solution cost with conditional probabilities
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
Uses Software
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)
