Sciweavers

746 search results - page 55 / 150
» Short Term Unit-Commitment Using Genetic Algorithms
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Revisiting genetic selection in the XCS learning classifier system
The XCS Learning Classifier System has traditionally used roulette wheel selection within its genetic algorithm component. Recently, tournament selection has been suggested as prov...
Faten Kharbat, Larry Bull, Mohammed Odeh
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 1 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
13 years 9 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
A comparison of evolutionary algorithms for system-level diagnosis
The size and complexity of systems based on multiple processing units demand techniques for the automatic diagnosis of their state. System-level diagnosis consists in determining ...
Bogdan Tomoyuki Nassu, Elias Procópio Duart...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 2 months ago
An analysis of constructive crossover and selection pressure in genetic programming
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
Huayang Xie, Mengjie Zhang, Peter Andreae