Please use this identifier to cite or link to this item:
http://hdl.handle.net/10174/17886
|
| Title: | Flexible cooperation in parallel local search |
| Authors: | Munera, Danny
Diaz, Daniel
Abreu, Salvador
Codognet, Philippe |
| Issue Date: | Mar-2014 |
| Publisher: | ACM Press |
| 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 |
| 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 ... |
| URI: | http://hdl.handle.net/10174/17886 |
| Type: | article |
| Appears in Collections: | INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
/
Departamento de Informática /
INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica /
