66 search results - page 8 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
AUTOMATICA
2008
13 years 7 months ago
2008
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...
CP
2003
Springer
14 years 21 days ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
ECAI
1992
Springer
13 years 11 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
AI
2008
Springer
13 years 7 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
CP
2001
Springer
13 years 12 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...