Sciweavers

1051 search results - page 14 / 211
» Foundations of Constraint Satisfaction
Sort
View
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
15 years 10 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
CSE
2009
IEEE
15 years 4 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
AAAI
1994
14 years 11 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
CSR
2008
Springer
14 years 9 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
CSUR
2000
69views more  CSUR 2000»
14 years 9 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet