1051 search results - page 17 / 211 » Foundations of Constraint Satisfaction |
96
Voted
HYBRID
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical con...
83
Voted
IAT
2008
IEEE
15 years 6 months ago
2008
IEEE
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
107
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
101
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...