285 search results - page 39 / 57 » The complexity of soft constraint satisfaction |
99
Voted
STACS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
174
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
60
Voted
CONSTRAINTS
2004
14 years 9 months ago
2004
We consider constructive preference elicitation for decision aid systems in applications such as configuration or electronic catalogs. We are particularly interested in supporting ...
90
Voted
KR
2010
Springer
15 years 2 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...