86 search results - page 9 / 18 » cp 2005 |
CP
2005
Springer
13 years 9 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The automatic modelling tool Conjure generates CSP models from problem specifications. The generated models may contain multiple alternative (redundant) representations ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...