Carsten Witt

From MaRDI portal
Person:306494

Available identifiers

zbMath Open witt.carstenWikidataQ51852318 ScholiaQ51852318MaRDI QIDQ306494

List of research outcomes

PublicationDate of PublicationType
First Steps Towards a Runtime Analysis of Neuroevolution2024-02-23Paper
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem2024-01-09Paper
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys2023-04-20Paper
Tail bounds on hitting times of randomized search heuristics using variable drift analysis2023-03-30Paper
Tight bounds on the expected runtime of a standard steady state genetic algorithm2022-06-01Paper
Self-adjusting evolutionary algorithms for multimodal optimization2022-06-01Paper
On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms2022-05-16Paper
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs2021-11-05Paper
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint2021-11-05Paper
Stagnation detection with randomized local search2021-10-18Paper
Runtime analysis for self-adaptive mutation rates2021-04-08Paper
The complex parameter landscape of the compact genetic algorithm2021-04-08Paper
Improved Fixed-Budget Results via Drift Analysis2020-06-12Paper
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax2020-05-26Paper
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools2020-02-11Paper
On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization2019-04-25Paper
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate2019-02-14Paper
Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax2019-02-14Paper
The impact of a sparse migration topology on the runtime of island models in dynamic optimization2018-05-18Paper
Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis2018-05-18Paper
Why standard particle swarm optimisers elude a theoretical runtime analysis2017-07-14Paper
When do evolutionary algorithms optimize separable functions in parallel?2017-07-14Paper
The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax2017-07-07Paper
A runtime analysis of parallel evolutionary algorithms in dynamic optimization2017-07-07Paper
Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax2017-06-13Paper
(1+1) EA on Generalized Dynamic OneMax2017-05-10Paper
MMAS versus population-based EA on a family of dynamic fitness functions2016-08-31Paper
Improved time complexity analysis of the simple genetic algorithm2015-10-30Paper
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift2015-09-11Paper
Fitness levels with tail bounds for the analysis of randomized search heuristics2015-06-25Paper
Runtime analysis of ant colony optimization on dynamic shortest path problems2014-12-02Paper
On the runtime analysis of the simple genetic algorithm2014-07-10Paper
Black-box search by unbiased variation2013-04-03Paper
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions2013-03-14Paper
https://portal.mardi4nfdi.de/entity/Q29047812012-08-23Paper
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs2012-05-14Paper
https://portal.mardi4nfdi.de/entity/Q32241072012-03-29Paper
Edge-Matching Problems with Rotations2011-08-19Paper
Simplified drift analysis for proving lower bounds in evolutionary computation2011-03-30Paper
Runtime analysis of the 1-ANT ant colony optimizer2011-03-29Paper
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity2010-11-18Paper
Ant colony optimization and the minimum spanning tree problem2010-05-27Paper
Runtime analysis of a binary particle swarm optimizer2010-05-27Paper
Runtime analysis of a simple ant colony optimization algorithm2009-06-22Paper
Greedy Local Search and Vertex Cover in Sparse Random Graphs2009-06-03Paper
Population size versus runtime of a simple evolutionary algorithm2009-01-15Paper
Runtime Analysis of a Simple Ant Colony Optimization Algorithm2008-04-24Paper
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions2007-11-29Paper
STACS 20052005-12-02Paper
On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions2005-05-04Paper
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics2005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q44368702003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q47854642003-02-04Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Carsten Witt