Skip to main content
Article thumbnail
Location of Repository

Restart Policies with Dependence among Runs: A Dynamic Programming Approach

By 

Abstract

Abstract. The time required for a backtracking search procedure to solve a problem can be reduced 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 case of dependent runs. 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 problems using two different solvers

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1027
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.rochester.edu/~k... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.