749 search results - page 40 / 150 » Dualities for Constraint Satisfaction Problems |
108
Voted
AIMSA
2008
Springer
15 years 28 days ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
83
Voted
SARA
2005
Springer
15 years 4 months ago
2005
Springer
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
FLAIRS
2004
15 years 10 days ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
GCC
2003
Springer
15 years 4 months ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
72
Voted
AI
2006
Springer
14 years 11 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...