198 search results - page 15 / 40 » Colouring, constraint satisfaction, and complexity |
FLAIRS
2008
15 years 1 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 4 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...
SODA
2000
ACM
15 years 29 days 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, ...
181
click to vote
CP
2009
Springer
16 years 8 days 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...
AGI
2008
15 years 1 months ago
2008
Whereas symbol