3 search results - page 1 / 1 » A Branch and Cut solver for the maximum stable set problem |
JCO
2011
12 years 7 months ago
2011
AI
2005
Springer
13 years 4 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
NIPS
2007
13 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...