1378 search results - page 36 / 276 » The Tractability of Global Constraints |
119
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
103
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
100
click to vote
ICTAI
2006
IEEE
15 years 8 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
COR
2006
15 years 2 months ago
2006
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the...
117
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...