Simulated annealing for hard satisfiability problems.
William M. SpearsPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- satisfiability problem
- simulated annealing
- graph coloring problems
- np complete
- random sat
- temporal logic
- search algorithm
- phase transition
- tabu search
- sat problem
- stochastic local search algorithms
- metaheuristic
- genetic algorithm
- combinatorial optimization
- evolutionary algorithm
- stochastic local search
- scheduling problem
- max sat
- mazurkiewicz traces
- pspace complete
- sat instances
- constraint satisfaction problems
- solving hard
- hill climbing
- cellular automata