par Roli, Andrea ;Blum, Christian
Référence Lecture notes in computer science, 2175, page (147-158)
Publication Publié, 2001
Article révisé par les pairs
Résumé : In this work we investigate the effects of the parallelization of a local search algorithm for MAX-SAT. The variables of the problem are divided in subsets and local search is applied to each of them in parallel, supposing that variables belonging to other subsets remain unchanged. We show empirical evidence for the existence of a critical level of parallelism which leads to the best performance. This result allows to improve local search and adds new elements to the investigation of criticality and parallelism in combinatorial optimization problems.