5138 search results - page 9 / 1028 » Randomized Algorithms for 3-SAT |
134
click to vote
FOCS
1995
IEEE
15 years 5 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...
116
Voted
SIAMCOMP
1998
15 years 1 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...
129
click to vote
AAAI
2000
15 years 2 months ago
2000
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
113
click to vote
AAAI
2008
15 years 3 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
131
click to vote
ICDCS
2000
IEEE
15 years 6 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...