Flexible cooperation in parallel local search
Loading...
Files
Date
Journal Title
Journal ISSN
Volume Title
Publisher
ACM Press
Abstract
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4]
for solving Constraint Satisfaction Problems (CSP). In order to further improve the
performance of Local Search, one possible option is to take advantage of the increasing
availability of parallel computational resources. Parallel implementation of local search meta-
heuristics has been studied since the early 90's, when multiprocessor machines started to
become widely available, see [6]. One usually distinguishes between single-walk and ...
Description
Keywords
Citation
Danny Munera, Daniel Diaz, Salvador Abreu, Philippe Codognet: Flexible cooperation in parallel local search, in 29th Annual ACM Symposium on Applied Computing, pp1360-1361