2174 search results - page 290 / 435 » On the Brittleness of Evolutionary Algorithms |
148
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
154
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
188
click to vote
AE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
176
click to vote
ICMLA
2007
15 years 7 months ago
2007
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
144
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...