5 search results - page 1 / 1 » Stronger Consistencies in WCSPs with Set Variables |
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
AAAI
2006
13 years 6 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of condition...
CP
2004
Springer
13 years 10 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
COMPULOG
1999
Springer
13 years 9 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...