285 search results - page 22 / 57 » The complexity of soft constraint satisfaction |
134
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
108
click to vote
FLAIRS
2008
15 years 4 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...
127
click to vote
ICMCS
2008
IEEE
15 years 8 months ago
2008
IEEE
Video transmission over a heterogeneous network suffers a condition that it has required to satisfy many different constraints because of the variety limitations of client equipme...
112
click to vote
CP
2001
Springer
15 years 6 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...