Sciweavers

1051 search results - page 7 / 211
» Foundations of Constraint Satisfaction
Sort
View
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
14 years 7 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
15 years 1 months 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...
EJC
2008
14 years 9 months ago
Majority constraints have bounded pathwidth duality
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
Víctor Dalmau, Andrei A. Krokhin
DAGSTUHL
2008
14 years 11 months ago
Dualities for Constraint Satisfaction Problems
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...
Andrei A. Bulatov, Andrei A. Krokhin, Benoit Laros...
IPL
2000
96views more  IPL 2000»
14 years 9 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad