218 search results - page 4 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
ECCC
2011
13 years 2 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
4OR
2006
13 years 7 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
IJCAI
1993
13 years 8 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...