Sciweavers

721 search results - page 22 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
Conditional Lexicographic Orders in Constraint Satisfaction Problems
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
Richard J. Wallace, Nic Wilson
CEC
2005
IEEE
15 years 3 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Bart G. W. Craenen, A. E. Eiben
IJCAI
2003
14 years 11 months ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
James Bowen, Chavalit Likitvivatanavong
AAAI
1996
14 years 11 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace