A full derandomization of schöning's k-SAT algorithm.
Robin A. MoserDominik SchederPublished in: STOC (2011)
Keyphrases
- optimization algorithm
- optimal solution
- computational cost
- preprocessing
- experimental evaluation
- simulated annealing
- objective function
- computational complexity
- times faster
- learning algorithm
- dynamic programming
- cost function
- k means
- search space
- improved algorithm
- theoretical analysis
- expectation maximization
- decision trees
- particle swarm optimization
- high accuracy
- multi objective
- significant improvement
- linear programming
- state space
- detection algorithm
- recognition algorithm
- search algorithm
- stochastic local search