Y. Ruan, E. Horvitz and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach, " in Proceedings of the Eight International Conference on Principles and Practice of Constraint Programming, Ithaca, NY, Sept. 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Boosting as a Metaphor for Algorithm Design - Leyton-Brown, Nudelman.. (Correct)
....among a set of regression models that were fit to minimize root mean squared error. A second classification approach entails dividing running times into two or more bins, predicting the bin that contains the algorithm s runtime, and then choosing the best algorithm. For example, Horvitz et al. [6, 14] used classification to predict runtime of CSP and SAT solvers with inherently high runtime variance (heavy tails) Despite its similarity to our portfolio methodology, this approach suffers from the use of a classification algorithm to predict runtime. First, the learning algorithm does not use ....
Y. Ruan, E. Horvitz, and H. Kautz. Restart policies with dependence among runs: A dynamic programming approach. In CP, 2002.
Hardness-Aware Restart Policies - Ruan, Horvitz, Kautz Self-citation (Ruan Horvitz Kautz) (Correct)
.... In pursuit of fast and robust search algorithms, investigators have targeted the uncertainty in run time directly with techniques including restarts and algorithm portfolios [5, 6, 7, 8, 9] We describe new methods that complement recent efforts on developing sound probabilistic restart policies [10, 11, 12]. The earlier work has centered on the use of machine learning to inform a reasoner about the probability distribution over the time required to solve a particular run of an instance drawn from a source distribution or ensemble. The efforts in predictive modeling to date have not addressed the ....
....decrease hardness variation within sub ensembles. The creation of instance sub ensembles enables a system to learn and reason about the probability distribution over the hardness of the specific instance at hand. We next review the dynamic programming approach to identifying ideal restart policies [12], now taking into consideration the likelihood of different hardnesses. We describe experiments we performed to test the methods. Finally, we discuss research opportunities. 2 Research on Restart Policies The run time of backtracking heuristic search algorithms is notoriously unpredictable. ....
[Article contains additional citation context not shown here]
Yongshao Ruan, Eric Horvitz, and Henry Kautz. Restart policies with dependence among runs: A dynamic programming approach. In Principles and Practice of Constraint Programming - CP 2002.
Foundations of Assisted Cognition Systems - Kautz, Etzioni, Fox, Weld (2003) (8 citations) Self-citation (Kautz) (Correct)
No context found.
Yongshao Ruan, Eric Horvitz, and Henry Kautz. Restart policies with dependence among runs: A dynamic programming approach. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-2002.
Analysis and Algorithms for Restart - van Moorsel, Wolter (2004) (Correct)
No context found.
Y. Ruan, E. Horvitz and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach, " in Proceedings of the Eight International Conference on Principles and Practice of Constraint Programming, Ithaca, NY, Sept. 2002.
A Measurement Study of the Interplay between.. - Reinecke, van.. (2004) (Correct)
No context found.
Y. Ruan, E. Horvitz and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach," in Proceedings of the Eight International Conference on Principles and Practice of Constraint Programming, Ithaca, NY, Sept. 2002.
Optimal Restart Times for Moments of Completion Time - van Moorsel, Wolter (2004) (Correct)
No context found.
Y. Ruan, E. Horvitz and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach," in Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, Ithaca, NY, Sept. 2002.
Boosting Stochastic Problem Solvers through Online Self-Analysis .. - Cicirello (2003) (Correct)
No context found.
Y. Ruan, E. Horvitz, and H. Kautz. Restart policies with dependence among runs: A dynamic programming approach. In P. Van Hentenryck, editor, Principles and Practice of Constraint Programming -- CP 2002: 8th International Conference, Proceedings, volume LNCS 2470 of Lecture Notes in Computer Science, pages 573--586. Springer-Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC