Derandomization of Schuler's Algorithm for SAT.
Evgeny DantsinAlexander WolpertPublished in: SAT (2004)
Keyphrases
- experimental evaluation
- times faster
- matching algorithm
- optimal solution
- detection algorithm
- preprocessing
- segmentation algorithm
- k means
- worst case
- dynamic programming
- similarity measure
- phase transition
- theoretical analysis
- computationally efficient
- cost function
- significant improvement
- search space
- objective function
- learning algorithm
- np hard
- computational complexity
- reinforcement learning
- convergence rate
- search strategy
- improved algorithm