980 search results - page 99 / 196 » Decentralized Constraint Satisfaction |
131
Voted
NAACL
2003
15 years 5 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...
106
click to vote
AAAI
1994
15 years 5 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
147
click to vote
EAAI
2008
15 years 4 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
146
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
156
click to vote
ECCC
2010
15 years 4 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...