5138 search results - page 6 / 1028 » Randomized Algorithms for 3-SAT |
NIPS
2004
13 years 8 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
AAAI
2008
13 years 9 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
AI
2003
Springer
14 years 18 days ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...