UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial

Algorithmica, 2021-04, Vol.83 (4), p.976-1011

Sudholt, Dirk

2021

Volltextzugriff (PDF)

Runtime Analysis of Quality Diversity Algorithms

Algorithmica, 2024-10, Vol.86 (10), p.3252-3283

2024

Volltextzugriff (PDF)

The Complex Parameter Landscape of the Compact Genetic Algorithm

Algorithmica, 2021-04, Vol.83 (4), p.1096-1137

2021

Volltextzugriff (PDF)

Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm

Algorithmica, 2022-06, Vol.84 (6), p.1603-1658

2022

Volltextzugriff (PDF)

Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter

Algorithmica, 2024-02, Vol.86 (2), p.526-565

2024

Volltextzugriff (PDF)

Analysing Equilibrium States for Population Diversity

Algorithmica, 2024, Vol.86 (7), p.2317-2351

2024

Volltextzugriff (PDF)

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

Algorithmica, 2021-10, Vol.83 (10), p.3148-3179

2021

Volltextzugriff (PDF)

How Crossover Speeds up Building Block Assembly in Genetic Algorithms

Evolutionary computation, 2017-06, Vol.25 (2), p.237-274

Sudholt, Dirk

2017

Volltextzugriff (PDF)

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

IEEE transactions on evolutionary computation, 2013-06, Vol.17 (3), p.418-435

Sudholt, D.

2013

Volltextzugriff (PDF)

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization

Algorithmica, 2019-04, Vol.81 (4), p.1450-1489

2019

Volltextzugriff (PDF)

Do additional target points speed up evolutionary algorithms?

Theoretical computer science, 2023-03, Vol.950, p.113757, Article 113757

2023

Volltextzugriff (PDF)

Parallel Black-Box Complexity With Tail Bounds

IEEE transactions on evolutionary computation, 2020-12, Vol.24 (6), p.1010-1024

2020

Volltextzugriff (PDF)

The impact of parametrization in memetic evolutionary algorithms

Theoretical computer science, 2009-06, Vol.410 (26), p.2511-2528

Sudholt, Dirk

2009

Volltextzugriff (PDF)

A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems

Algorithmica, 2012-12, Vol.64 (4), p.643-672

2012

Volltextzugriff (PDF)

Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search

Evolutionary computation, 2017-06, Vol.25 (2), p.205-236

2017

Volltextzugriff (PDF)

Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

Artificial intelligence, 2020-10, Vol.287, p.103345, Article 103345

2020

Volltextzugriff (PDF)

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism

Evolutionary computation, 2019-09, Vol.27 (3), p.403-433

2019

Volltextzugriff (PDF)

The choice of the offspring population size in the (1,λ) evolutionary algorithm

Theoretical computer science, 2014-08, Vol.545, p.20-38

2014

Volltextzugriff (PDF)

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation

Algorithmica, 2019-02, Vol.81 (2), p.589-592

2019

Volltextzugriff (PDF)

Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms

Evolutionary computation, 2015-12, Vol.23 (4), p.559-582

2015

Volltextzugriff (PDF)

Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation

Artificial intelligence, 2024-05, Vol.330, p.104098, Article 104098

2024

Volltextzugriff (PDF)

Self-adjusting offspring population sizes outperform fixed parameters on the cliff function

Artificial intelligence, 2024-03, Vol.328, p.104061, Article 104061

2024

Volltextzugriff (PDF)

Runtime Analysis of Crowding Mechanisms for Multimodal Optimization

IEEE transactions on evolutionary computation, 2020-06, Vol.24 (3), p.581-592

2020

Volltextzugriff (PDF)

Escaping Local Optima Using Crossover With Emergent Diversity

IEEE transactions on evolutionary computation, 2018-06, Vol.22 (3), p.484-497

2018

Volltextzugriff (PDF)

Running time analysis of Ant Colony Optimization for shortest path problems

Journal of discrete algorithms (Amsterdam, Netherlands), 2012, Vol.10, p.165-180

2012

Volltextzugriff (PDF)

1 – 25 von 148

Menü

Weitere Dienste

Einstellungen

Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial

Runtime Analysis of Quality Diversity Algorithms

The Complex Parameter Landscape of the Compact Genetic Algorithm

Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm

Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter

Analysing Equilibrium States for Population Diversity

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

How Crossover Speeds up Building Block Assembly in Genetic Algorithms

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization

Do additional target points speed up evolutionary algorithms?

Parallel Black-Box Complexity With Tail Bounds

The impact of parametrization in memetic evolutionary algorithms

A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems

Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search

Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism

The choice of the offspring population size in the (1,λ) evolutionary algorithm

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation

Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms

Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation

Self-adjusting offspring population sizes outperform fixed parameters on the cliff function

Runtime Analysis of Crowding Mechanisms for Multimodal Optimization

Escaping Local Optima Using Crossover With Emergent Diversity

Running time analysis of Ant Colony Optimization for shortest path problems

Suchergebnisse filtern