1300 search results - page 18 / 260 » Constraint satisfaction problems and global cardinality cons... |
78
Voted
JGO
2008
14 years 9 months ago
2008
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
IJCAI
1989
14 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...