Name
Abstract | ||
|---|---|---|
In this paper, a new selection scheme for a (m + 1) steady-state evolution strategy is described: the so-called median selection. In contrast to generational algorithms, only one individual is generated and evaluated in one step of the algorithm and is immediately integrated into the population. Previous steady-state algorithms are similar to the (m + l) selection scheme in evolution strategies, which has a disadvantage in the fast self-adaptation of mutation step-length. This is compensated by ... |
Year | Venue | Keywords |
|---|---|---|
2000 | GECCO | evolution strategy,steady state,generic algorithm |
Field | DocType | Citations |
Population,Mathematical optimization,Computer science,Evolution strategy,Artificial intelligence,Steady state,Machine learning | Conference | 2 |
PageRank | References | Authors |
0.52 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Wakunda | 1 | 17 | 3.12 |
| Andreas Zell | 2 | 63 | 14.45 |