Sciweavers

419 search results - page 38 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
CP
2006
Springer
14 years 6 days ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
CP
2003
Springer
14 years 1 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
CVPR
2008
IEEE
14 years 10 months ago
3D surface models by geometric constraints propagation
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...
Michela Farenzena, Andrea Fusiello
BVAI
2007
Springer
14 years 2 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
CISSE
2008
Springer
13 years 10 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier