Golden Ratio Annealing for Satisfiability Problems Using Dynamically Cooling Schemes.
Juan Frausto SolísFelix Martinez-RiosPublished in: ISMIS (2008)
Keyphrases
- satisfiability problem
- simulated annealing
- np complete
- phase transition
- search algorithm
- temporal logic
- solving hard
- sat problem
- stochastic local search algorithms
- max sat
- mazurkiewicz traces
- davis putnam
- stochastic local search
- sat instances
- pspace complete
- scheduling problem
- genetic algorithm
- graph coloring problems
- np hard
- computational complexity
- search procedures
- constraint satisfaction
- finite domain
- cellular automata
- tabu search
- constraint satisfaction problems