198 search results - page 15 / 40 » Colouring, constraint satisfaction, and complexity |
FLAIRS
2008
14 years 11 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
83
Voted
SODA
2000
ACM
14 years 10 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
159
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
84
Voted
AGI
2008
14 years 11 months ago
2008
Whereas symbol