Sciweavers

1051 search results - page 91 / 211
» Foundations of Constraint Satisfaction
Sort
View
CSCLP
2004
Springer
14 years 3 months ago
Dynamic Distributed BackJumping
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 ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
CP
2006
Springer
14 years 1 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
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