18 search results - page 1 / 4 » Nonbinary Constraint Satisfaction: From the Dual to the Prim... |
FLAIRS
2001
13 years 6 months ago
2001
Nonbinaryconstraints haverecently beenstudiedquite extensivelysincethey representreal life problemsverynaturally. Specifically,extensionsto binaryarc consistencyinto generalised a...
AAAI
1998
13 years 6 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
TIP
2008
13 years 4 months ago
2008
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...