Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
New ideas in optimization
The ant colony optimization meta-heuristic
New ideas in optimization
Memetic algorithms: a short introduction
New ideas in optimization
Tabu Search
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization
Journal of Heuristics
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Criticality and Parallelism in Structured SAT Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
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.