Search Sciweavers | Sciweavers

714 search results - page 23 / 143

» Lexicographically-ordered constraint satisfaction problems

click to vote

CEC
2005
IEEE

127views Artificial Intelligence» more CEC 2005»

Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?

15 years 3 months ago

Download www.cs.vu.nl

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

claim paper

Read More »

click to vote

IJCAI
2003

85views Artificial Intelligence» more IJCAI 2003»

Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems

14 years 10 months ago

Download www.comp.nus.edu.sg

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

claim paper

Read More »

Voted

AAAI
1996

119views Intelligent Agents» more AAAI 1996»

Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem

14 years 10 months ago

Download www.aaai.org

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

claim paper

Read More »

click to vote

IWANN
2009
Springer

196views Neural Networks» more IWANN 2009»

Evolutionary Genetic Algorithms in a Constraint Satisfaction Problem: Puzzle Eternity II

15 years 4 months ago