1142 search results - page 25 / 229 » Approximability of Clausal Constraints |
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
STACS
2010
Springer
15 years 6 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
182
click to vote
VLDB
2001
ACM
15 years 12 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
ICMCS
2010
IEEE
15 years 24 days ago
2010
IEEE
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
ANOR
2010
14 years 12 months ago
2010
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...