180 search results - page 14 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
CP
2009
Springer
14 years 8 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...
ACL
1990
13 years 8 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
APPROX
2005
Springer
14 years 1 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...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
AIPS
2009
13 years 8 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...