Moser-Tardos Algorithm with small number of random bits.
Endre CsókaLukasz GrabowskiAndrás MáthéOleg PikhurkoKonstantinos TyrosPublished in: CoRR (2022)
Keyphrases
- small number
- np hard
- estimation algorithm
- matching algorithm
- k means
- linear programming
- single pass
- times faster
- expectation maximization
- experimental evaluation
- optimal solution
- randomly generated
- detection algorithm
- optimization algorithm
- input data
- worst case
- significant improvement
- dynamic programming
- learning algorithm
- search space
- preprocessing
- simulated annealing
- theoretical analysis
- tree structure
- path planning
- computational complexity
- convergence rate
- selection algorithm
- improved algorithm
- probabilistic model
- objective function