711 search results - page 55 / 143 » Amalgams of Constraint Satisfaction Problems |
135
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
137
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
153
click to vote
SAGA
2001
Springer
15 years 9 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
152
click to vote
EAAI
2008
15 years 4 months ago
2008
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...
157
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...