Product
Help
Pricing
About
Jobs
Log in
Get started
Source
Add to collection
Foundations of Genetic Algorithms
Source type:
conference
Fully OA:
No
DOAJ:
No
OpenAlex ID:
S4306422346
Adaptive population models for offspring populations and parallel evolutionary algorithms
2011
·
Jörg Lässig
, Dirk Sudholt
·
Foundations of Genetic Algorithms
·
80
PDF
Faster black-box algorithms through higher arity operators
2011
·
Benjamin Doerr
, Daniel Johannsen
, et al.
·
Foundations of Genetic Algorithms
·
73
Evolving diverse TSP instances by means of novel and creative mutation operators
2019
·
Jakob Bossek
, Pascal Kerschke
, et al.
·
Foundations of Genetic Algorithms
·
61
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
2011
·
Greg Durrett
, Frank Neumann
, et al.
·
Foundations of Genetic Algorithms
·
44
PDF
Analysis of evolutionary algorithms
2011
·
Thomas Jansen
, Christine Zarges
·
Foundations of Genetic Algorithms
·
41
The benefits and limitations of voting mechanisms in evolutionary optimisation
2019
·
Jonathan E. Rowe
, Aishwaryaprajna
·
Foundations of Genetic Algorithms
·
37
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
2019
·
Per Kristian Lehre
, Phan Trung Hai Nguyen
·
Foundations of Genetic Algorithms
·
35
PDF
Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax
2017
·
Martin S. Krejca
, Carsten Witt
·
Foundations of Genetic Algorithms
·
35
Abstract convex evolutionary search
2011
·
Alberto Moraglio
·
Foundations of Genetic Algorithms
·
34
New features for continuous exploratory landscape analysis based on the SOO tree
2019
·
Bilel Derbel
, Arnaud Liefooghe
, et al.
·
Foundations of Genetic Algorithms
·
33
The logarithmic hypervolume indicator
2011
·
Tobias Friedrich
, Karl Bringmann
, et al.
·
Foundations of Genetic Algorithms
·
32
Towards the geometry of estimation of distribution algorithms based on the exponential family
2011
·
Luigi Malagò
, Matteo Matteucci
, et al.
·
Foundations of Genetic Algorithms
·
32
Non-uniform mutation rates for problems with unknown solution lengths
2011
·
Stephan Cathabard
, Per Kristian Lehre
, et al.
·
Foundations of Genetic Algorithms
·
31
Simple max-min ant systems and the optimization of linear pseudo-boolean functions
2011
·
Timo Kötzing
, Frank Neumann
, et al.
·
Foundations of Genetic Algorithms
·
27
PDF
A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
2019
·
Denis Antipov
, Benjamin Doerr
, et al.
·
Foundations of Genetic Algorithms
·
26
Linearly Convergent Evolution Strategies via Augmented Lagrangian Constraint Handling
2017
·
Asma Atamna
, Anne Auger
, et al.
·
Foundations of Genetic Algorithms
·
24
On the behaviour of the (1,λ)-es for a simple constrained problem
2011
·
Dirk V. Arnold
·
Foundations of Genetic Algorithms
·
23
Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems
2017
·
Hisao Ishibuchi
, Ryo Imada
, et al.
·
Foundations of Genetic Algorithms
·
22
Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
2021
·
Mario Alejandro Hevia Fajardo
, Dirk Sudholt
·
Foundations of Genetic Algorithms
·
21
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
2019
·
Frank Neumann
, Andrew M. Sutton
·
Foundations of Genetic Algorithms
·
21
Generalized drift analysis in continuous domain
2019
·
Daiki Morinaga
, Youhei Akimoto
·
Foundations of Genetic Algorithms
·
19
An exponential lower bound for the runtime of the compact genetic algorithm on jump functions
2019
·
Benjamin Doerr
·
Foundations of Genetic Algorithms
·
17
PDF
Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions
2017
·
Youhei Akimoto
, Anne Auger
, et al.
·
Foundations of Genetic Algorithms
·
16
Analysis of the Clearing Diversity-Preserving Mechanism
2017
·
Edgar Covantes Osuna
, Dirk Sudholt
·
Foundations of Genetic Algorithms
·
16
Convergence rates of SMS-EMOA on continuous bi-objective problem classes
2011
·
Nicola Beume
, Marco Laumanns
, et al.
·
Foundations of Genetic Algorithms
·
16
Show more works
View as search
Works count:
103
Citation count:
1,163
H-index:
20
I10-index:
38
2yr mean citedness:
0.778
Year
Topic
Type