48 search results - page 2 / 10 » Note on MAX 2SAT |
122
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
138
Voted
AAAI
2004
15 years 4 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
94
Voted
CP
2005
Springer
15 years 8 months ago
2005
Springer
143
Voted
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
127
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...