Author(s): Munera, Danny ; Diaz, Daniel ; Abreu, Salvador ; Codognet, Philippe
Date: 2016
Persistent ID: http://hdl.handle.net/10174/17886
Origin: Repositório Científico da Universidade de Évora
Author(s): Munera, Danny ; Diaz, Daniel ; Abreu, Salvador ; Codognet, Philippe
Date: 2016
Persistent ID: http://hdl.handle.net/10174/17886
Origin: Repositório Científico da Universidade de Évora
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 ...