A Bayesian Approach to Tackling Hard Computational Problems

@article{Horvitz2001ABA,
  title={A Bayesian Approach to Tackling Hard Computational Problems},
  author={Eric Horvitz and Yongshao Ruan and Carla P. Gomes and Henry A. Kautz and Bart Selman and David Maxwell Chickering},
  journal={Electronic Notes in Discrete Mathematics},
  year={2001},
  volume={9},
  pages={376-391}
}
We describe research and results centering on the construction and use of Bayesian models that can predict the run time of problem solvers. Our efforts are motivated by observations of high variance in the time required to solve instances for several challenging problems. The methods have application to the decision-theoretic control of hard search and reasoning algorithms. We illustrate the approach with a focus on the task of predicting run time for general and domain-specific solvers on a… CONTINUE READING
Highly Cited
This paper has 144 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

145 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 145 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…