This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
Pascal Van Hentenryck, Pierre Flener, Justin Pears...
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...
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 ...
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...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...