Predicting optimal solution cost with conditional probabilities

DOI10.1007/S10472-014-9432-8MaRDI QIDQ2254628zbMATH OpenOpenAlexFDO

Authors Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte

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

zbMATH Keywords

heuristic searchtype systemsoptimal solution cost prediction

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
• scientific article; zbMATH DE number 3279667
• Adaptive solution prediction for combinatorial optimization
• Reasoning about cost-utility constraints in probabilistic models
• The use of conditional approximation in optimization problems
• Optimization models with probabilistic constraints
• Pattern-based modeling and solution of probabilistically constrained optimization problems
• Solving stochastic optimization models with learning and rational expectations
• scientific article; zbMATH DE number 1568995

Cites work

• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 67463 (Why is no real title available?)
• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• A Modern Treatment of the 15 Puzzle
• A general theory of additive state space abstractions
• Depth-first iterative-deepening: An optimal admissible tree search
• Disjoint pattern database heuristics
• Duality in permutation state spaces and the dual search algorithm
• Estimating the Efficiency of Backtrack Programs
• Iterative-deepening search with on-line tree size prediction
• Learning heuristic functions for large state spaces
• Linear-space best-first search
• Linear-time disk-based implicit graph search
• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
• Predicting the performance of IDA\(^*\) using conditional distributions
• Predicting the size of IDA\(^*\)'s search tree
• Time complexity of iterative-deepening-\(A^{*}\)

Cited in

(3)

• Rational deployment of multiple heuristics in optimal state-space search
• Heuristics as Markov chains
• Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces

This page was built for publication: Predicting optimal solution cost with conditional probabilities

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