The time required for a backtracking search procedure to solve a problem can be minimized by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assumption that runs are probabilistically independent from one another. We relax the assumption of independence among runs and address the challenge of identifying an optimal restart policy for the dependent case. We show how offline dynamic programming can be used to generate an ideal restart policy, and how the policy can be used in conjunction with real-time observations to control the timing of restarts. We present results of experiments on applying the methods to create ideal restart policies for several challenging search problems using two different solvers.
CITATION STYLE
Ruan, Y., Horvitz, E., & Kautz, H. (2002). Restart policies with dependence among runs: A dynamic programming approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2470, pp. 573–586). Springer Verlag. https://doi.org/10.1007/3-540-46135-3_38
Mendeley helps you to discover research relevant for your work.