Yongshao Ruan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongshao Ruan has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bart Selman
Department of Computer Science Cornell University
1 shared publication - Carla Pedro Gomes
Cornell University
1 shared publication David Maxwell Chickering
1 shared publication- Eric Horvitz
Microsoft, Redmond, WA, USA
1 shared publication - Henry Kautz
Department of Computer Science, University of Rochester, Rochester, NY, United States
1 shared publication
Latest Publications
- Open Access
A Bayesian Approach to Tackling Hard Computational Problems
We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms. We illustrate the approach on the specific task of controlling both general and domain-specific solvers on a hard class of structured constraint satisfaction problems. A successful strategyfor reducing the high (and even infinite) variance in running time typically exhibited by backtracking search algorithms is to cut off and restart the search if a solution is not found within a certainamount of time. Previous work on restart strategies have employed fixed cut off values. We show how to create a dynamic cut off strategy by learning a Bayesian model that predicts the ultimate length of a trial based on observing the early behavior of the search algorithm. Furthermore, we describe the general conditions under which a dynamic restart strategy can outperform the theoretically optimal fixed strategy.
Open AccessA Bayesian Approach to Tackling Hard Computational Problems
We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms. We illustrate the approach on the specific task of controlling both general and domain-specific solvers on a hard class of structured constraint satisfaction problems. A successful strategyfor reducing the high (and even infinite) variance in running time typically exhibited by backtracking search algorithms is to cut off and restart the search if a solution is not found within a certainamount of time. Previous work on restart strategies have employed fixed cut off values. We show how to create a dynamic cut off strategy by learning a Bayesian model that predicts the ultimate length of a trial based on observing the early behavior of the search algorithm. Furthermore, we describe the general conditions under which a dynamic restart strategy can outperform the theoretically optimal fixed strategy.