129 search results - page 3 / 26 » A MAX-SAT Algorithm Portfolio |
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
AAAI
2008
13 years 7 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...
IBERAMIA
2004
Springer
13 years 10 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
COCOON
1998
Springer
13 years 9 months ago
1998
Springer