Why Asynchronous Parallel Evolution is the Future of Hyper-heuristics: A CDCL SAT Solver Case Study.
Alex R. BertelsDaniel R. TauritzPublished in: GECCO (Companion) (2016)
Keyphrases
- sat solvers
- hyper heuristics
- constraint satisfaction
- orders of magnitude
- constraint satisfaction problems
- search space
- sat problem
- sat instances
- max sat
- propositional satisfiability
- search tree
- sat solving
- boolean satisfiability
- search strategies
- sat encodings
- evolutionary algorithm
- clause learning
- heuristic search
- genetic programming
- timetabling problem
- boolean formula
- difficult problems
- multi objective
- graph coloring
- information retrieval
- search algorithm
- special case
- simulated annealing
- search procedure