- author = "Alex S. Fukunaga",
- title = "Massively Parallel Evolution of {SAT} Heuristics",
- booktitle = "2009 IEEE Congress on Evolutionary Computation",
- year = "2009",
- editor = "Andy Tyrrell",
- pages = "1478--1485",
- address = "Trondheim, Norway",
- month = "18-21 " # may,
- organization = "IEEE Computational Intelligence Society",
- publisher = "IEEE Press",
- isbn13 = "978-1-4244-2959-2",
- file = "P308.pdf",
-
DOI = "
doi:10.1109/CEC.2009.4983117",
- size = "8 pages",
- abstract = "Recent work has shown that it is possible to evolve heuristics for solving propositional satisfiability (SAT) problems which are competitive with the best hand-coded heuristics. However, previous work was limited by the computational resources required in order to evolve successful heuristics. In this paper, we describe a massively parallel genetic programming system for evolving SAT heuristics. Runs using up to 5.5 CPU core years of computation were executed, and resulted in new SAT heuristics which significantly outperform hand-coded heuristics.",
- keywords = "genetic algorithms, genetic programming, STGP, hyperheuristics, MPI",
-
notes = "up to a million fitness evaluations. pop=10000,100
gens. 8 percent reproduction. Sometimes used normal
(Koza like) crossover and mutation, in place of own SAT
composition operator. Complicated, stepped, fitness
function.
CLASS, PCLASS. Compiled common lisp includes S-expressions simplification and caching subexpressions. Master-slave parallelism 720 2.83GHz E5440 core Sun blade X6250 cluster (claims idle time approx 2 percent). SAT/UNSAT phase transition mkcnf SATLIB.
CEC 2009 - A joint meeting of the IEEE, the EPS and the IET. IEEE Catalog Number: CFP09ICE-CDR",
