DocumentCode :
1999181
Title :
Sequential and Parallel Restart Policies for Constraint-Based Local Search
Author :
Caniou, Yves ; Codognet, Philippe
Author_Institution :
JFLI, Univ. of Tokyo, Tokyo, Japan
fYear :
2013
fDate :
20-24 May 2013
Firstpage :
1754
Lastpage :
1763
Abstract :
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.
Keywords :
combinatorial mathematics; mathematics computing; parallel algorithms; search problems; Costas array problems; Magic square; adaptive search; combinatorial problems; combinatorial search problems; constraint-based local search method; parallel local search algorithms; parallel restart policy; sequential restart policy; Arrays; Benchmark testing; Exponential distribution; Optimization; Runtime; Search problems; constraint solving; costas arrays; local search; metaheuristics; parallelism;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2013 IEEE 27th International
Conference_Location :
Cambridge, MA
Print_ISBN :
978-0-7695-4979-8
Type :
conf
DOI :
10.1109/IPDPSW.2013.211
Filename :
6651075
Link To Document :
بازگشت