416 search results - page 2 / 84 » Relational consistency by constraint filtering |
JCP
2006
13 years 5 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
FLAIRS
2007
13 years 7 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
AAAI
2004
13 years 6 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
CP
2008
Springer
13 years 7 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
ICTAI
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...