Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
DOI10.1016/J.ARTINT.2015.09.012zbMATH Open1344.68216OpenAlexW2197146024MaRDI QIDQ901034FDOQ901034
Robert C. Holte, Roni Stern, Ariel Felner, Shahab Jabbari Arfaee, Sandra Zilles, Levi H. S. Lelis
Publication date: 23 December 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.locus.ufv.br/handle/123456789/21957
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning as heuristic search
- The FF planning system: Fast plan generation through heuristic search
- Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
- Estimating the Efficiency of Backtrack Programs
- Depth-first iterative-deepening: An optimal admissible tree search
- Blocks World revisited
- Disjoint pattern database heuristics
- Predicting the size of IDA\(^*\)'s search tree
- A Modern Treatment of the 15 Puzzle
- Duality in permutation state spaces and the dual search algorithm
- Learning heuristic functions for large state spaces
- The heuristic search under conditions of error
- Predicting the Performance of IDA* using Conditional Distributions
- Time complexity of iterative-deepening-\(A^{*}\)
- A real-time algorithm for the \((n^{2}-1)\)-puzzle
- Predicting optimal solution cost with conditional probabilities
Cited In (2)
This page was built for publication: Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901034)
