Sciweavers

980 search results - page 99 / 196
» Decentralized Constraint Satisfaction
Sort
View
NAACL
2003
13 years 11 months ago
Language choice models for microplanning and readability
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...
Sandra Williams
AAAI
1994
13 years 11 months ago
Dead-End Driven Learning
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 ...
Daniel Frost, Rina Dechter
EAAI
2008
104views more  EAAI 2008»
13 years 10 months ago
Feasible distributed CSP models for scheduling problems
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...
Miguel A. Salido, Adriana Giret
APPROX
2010
Springer
297views Algorithms» more  APPROX 2010»
13 years 11 months ago
Approximating Linear Threshold Predicates
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 +...
Mahdi Cheraghchi, Johan Håstad, Marcus Isaks...
ECCC
2010
111views more  ECCC 2010»
13 years 10 months ago
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
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...
Venkatesan Guruswami, Yuan Zhou