10 search results - page 1 / 2 » Optimal myopic algorithms for random 3-SAT |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
AI
1999
Springer
13 years 4 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 8 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...