Predicting optimal solution cost with conditional probabilities
From MaRDI portal
Publication:2254628
DOI10.1007/s10472-014-9432-8zbMath1319.68206OpenAlexW2152056108MaRDI QIDQ2254628
Levi H. S. Lelis, Sandra Zilles, Robert C. Holte, Ariel Felner, Roni Stern
Publication date: 5 February 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.locus.ufv.br/handle/123456789/21991
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (3)
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ Heuristics as Markov chains
Cites Work
- Predicting the size of IDA\(^*\)'s search tree
- Learning heuristic functions for large state spaces
- Linear-space best-first search
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Depth-first iterative-deepening: An optimal admissible tree search
- Iterative-deepening search with on-line tree size prediction
- Duality in permutation state spaces and the dual search algorithm
- A Modern Treatment of the 15 Puzzle
- Linear-time disk-based implicit graph search
- Estimating the Efficiency of Backtrack Programs
- Predicting the Performance of IDA* using Conditional Distributions
- Time complexity of iterative-deepening-\(A^{*}\)
- Disjoint pattern database heuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Predicting optimal solution cost with conditional probabilities
