Sciweavers

2174 search results - page 41 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
CHINAF
2011
14 years 1 months ago
Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate
One approach for evolutionary algorithms (EAs) to address dynamic optimization problems (DOPs) is to maintain diversity of the population via introducing immigrants. So far all imm...
Xin Yu, Ke Tang, Xin Yao
AE
2007
Springer
15 years 4 months ago
On the Design of Adaptive Control Strategies for Evolutionary Algorithms
This paper focuses on the design of control strategies for Evolutionary Algorithms. We propose a method to encapsulate multiple parameters, reducing control to only one criterion. ...
Jorge Maturana, Frédéric Saubion
EC
2006
163views ECommerce» more  EC 2006»
14 years 10 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
AAAI
2006
14 years 11 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu
EVOW
2007
Springer
15 years 4 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...