Sciweavers

942 search results - page 31 / 189
» Distance Constraint Satisfaction Problems
Sort
View
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 5 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
CPAIOR
2006
Springer
14 years 6 days ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
SIAMDM
2008
90views more  SIAMDM 2008»
13 years 8 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
DAGSTUHL
2006
13 years 10 months ago
Constraint Satisfaction with Succinctly Specified Relations
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
Hubie Chen, Martin Grohe
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 8 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee