201 search results - page 17 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
123
click to vote
PODS
2007
ACM
16 years 1 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
109
click to vote
CISSE
2008
Springer
15 years 3 months ago
2008
Springer
: 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 ...
123
click to vote
CP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
113
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
110
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
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 ...