Sciweavers

711 search results - page 118 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
SAC
2009
ACM
15 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 3 months ago
Output-feedback controlled-invariant polyhedra for constrained linear systems
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...
Carlos Eduardo Trabuco Dórea
PPDP
2010
Springer
14 years 10 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
DEBS
2011
ACM
14 years 3 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
AI
2010
Springer
14 years 12 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...