1381 search results - page 14 / 277 » Computational Complexity of Constraint Satisfaction |
124
Voted
CSUR
2000
15 years 3 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
112
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
139
Voted
ECML
2005
Springer
15 years 9 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
130
Voted
WSTST
2005
Springer
15 years 9 months ago
2005
Springer
105
Voted
SAC
2000
ACM
15 years 7 months ago
2000
ACM
