Flexible cooperation in parallel local search
| dc.contributor.author | Munera, Danny | |
| dc.contributor.author | Diaz, Daniel | |
| dc.contributor.author | Abreu, Salvador | |
| dc.contributor.author | Codognet, Philippe | |
| dc.date.accessioned | 2016-03-10T10:19:47Z | |
| dc.date.available | 2016-03-10T10:19:47Z | |
| dc.date.issued | 2014-03 | |
| dc.description.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 ... | por |
| dc.identifier.authoremail | nd | |
| dc.identifier.authoremail | nd | |
| dc.identifier.authoremail | salvador.abreu@acm.org | |
| dc.identifier.authoremail | nd | |
| dc.identifier.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 | por |
| dc.identifier.scientificarea | 283 | por |
| dc.identifier.uri | http://hdl.handle.net/10174/17886 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | ACM Press | por |
| dc.rights | openAccess | por |
| dc.title | Flexible cooperation in parallel local search | por |
| dc.type | article | por |