Critical parallelization of local search for MAX-SAT

DOI10.1007/3-540-45411-X_16MaRDI QIDQ4799255zbMATH OpenFDO

Authors Andrea Roli, Christian Blum

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2175/21750147.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27)

Recommendations

• Criticality and parallelism in GSAT
• Parallel local search
• Efficiency of Local Search
• Parallelizing local search for CNF satisfiability using vectorization and PVM
• scientific article; zbMATH DE number 857591

Cited in

(4)

• Large-scale parallelism for constraint-based local search: the costas array case study
• Criticality and parallelism in GSAT
• The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
• Parallelizing local search for CNF satisfiability using vectorization and PVM

This page was built for publication: Critical parallelization of local search for MAX-SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799255)