129 search results - page 4 / 26 » A MAX-SAT Algorithm Portfolio |
ESA
2011
Springer
12 years 6 months ago
2011
Springer
JAL
2000
13 years 6 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
CP
2003
Springer
13 years 11 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
ICALP
1999
Springer
13 years 10 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove
DISOPT
2011
13 years 1 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...