Predicting optimal solution cost with conditional probabilities

Annals of Mathematics and Artificial Intelligence, Volume 72, Issue 3-4, 2014, Pages 267-295.

Cited by: 4|Bibtex|Views15|DOI:https://doi.org/10.1007/s10472-014-9432-8
EI
Other Links: dl.acm.org|link.springer.com

Abstract:

Heuristic search algorithms are designed to return an optimal path from a start state to a goal state. They find the optimal solution cost as a side effect. However, there are applications in which all one wants to know is an estimate of the optimal solution cost. The actual path from start to goal is not initially needed. For instance, o...More

Code:

Data:

Your rating :
0

 

Tags
Comments