749 search results - page 82 / 150 » Dualities for Constraint Satisfaction Problems |
87
Voted
APPROX
2005
Springer
15 years 6 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...
101
click to vote
NAACL
2003
15 years 2 months ago
2003
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
215
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
100
click to vote
CSCLP
2004
Springer
15 years 6 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
108
click to vote
ISNN
2005
Springer
15 years 6 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...