Solving hard satisfiability problems with synchronous simulated annealing on the AP1000 multiprocessor.
Andrew SohnPublished in: SPDP (1995)
Keyphrases
- solving hard
- satisfiability problem
- simulated annealing
- combinatorial problems
- metaheuristic
- np complete
- search algorithm
- combinatorial optimization
- temporal logic
- tabu search
- stochastic local search
- phase transition
- evolutionary algorithm
- genetic algorithm
- sat problem
- hill climbing
- search problems
- propositional satisfiability
- davis putnam
- propositional logic
- sat instances
- max sat
- expressive power
- data structure