18 search results - page 2 / 4 » Nonbinary Constraint Satisfaction: From the Dual to the Prim... |
AI
2008
Springer
13 years 5 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
JAIR
2011
13 years 16 days ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
ICASSP
2008
IEEE
14 years 1 days ago
2008
IEEE
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. T...
TOG
2012
11 years 8 months ago
2012
We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are c...