Sequential and Parallel Restart Policies for Constraint-Based Local Search
Yves Caniou, Philippe Codognet · 2013
We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems.