Flexible cooperation in parallel local search
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 r...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2016
|
| Texto completo: | http://hdl.handle.net/10174/17886 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/17886 |