Transition models as an incremental approach for problem solving in evolutionary algorithms

Authors:
Anne Defaweux;Tom Lenaerts;Jano van Hemert;Johan Parent
Affiliations:
Vrije Universiteit Brussel, Brussels, Belgium;Université Libre de Bruxelles, Brussels, Belgium;Napier University, Edinburgh, United Kingdom;Vrije Universiteit Brussel, Brussels, Belgium
Venue:
Year:
2005

Dead-end driven learning

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
The design and analysis of a computational model of cooperative coevolution

The design and analysis of a computational model of cooperative coevolution
Random Constraint Satisfaction: A More Accurate Picture

Constraints
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An Individual-based Approach To Multi-level Selection

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Comparing evolutionary algorithms on binary constraint satisfaction problems

IEEE Transactions on Evolutionary Computation

How an optimal observer can collapse the search space

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A gestalt genetic algorithm: less details for better search

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary transitions as a metaphor for evolutionary optimisation

ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life

Hi-index	0.00