291 search results - page 7 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
AAAI
1997
13 years 9 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
ECCC
2010
13 years 7 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...