Dirk Sudholt

Citado por

	Total	Desde 2019
Citas	3970	2041
Índice h	36	24
Índice i10	102	64

500

250

125

375

20072008200920102011201220132014201520162017201820192020202120222023202421 52 54 69 153 137 188 180 204 211 290 305 378 385 337 323 488 126

Acceso público

Ver todo

61 artículos

5 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Carsten WittTechnical University of DenmarkDirección de correo verificada de imm.dtu.dk
Pietro S. OlivetoProfessor of Computer Science, Chair in Algorithms, The University of SheffieldDirección de correo verificada de sheffield.ac.uk
Frank NeumannOptimisation and Logistics, School of ComputerDirección de correo verificada de adelaide.edu.au
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyDirección de correo verificada de hpi.de
Per Kristian LehreProfessor at University of Birmingham and UKRI Turing AI Acceleration FellowDirección de correo verificada de cs.bham.ac.uk
Duc-Cuong DangUniversity of Southampton, UKDirección de correo verificada de soton.ac.uk
Thomas JansenAberystwyth UniversityDirección de correo verificada de aber.ac.uk
Tiago PaixaoInstituto Gulbenkian de CiênciaDirección de correo verificada de igc.gulbenkian.pt
Christine ZargesDepartment of Computer Science, Aberystwyth UniversityDirección de correo verificada de aber.ac.uk
Andrew M. SuttonUniversity of Minnesota DuluthDirección de correo verificada de umn.edu
Martin S. KrejcaLIX, CNRS, Ecole Polytechnique, IPPDirección de correo verificada de polytechnique.edu
Edgar Covantes OsunaProfessorDirección de correo verificada de tec.mx
Barbora TrubenováETH ZurichDirección de correo verificada de env.ethz.ch
Benjamin DoerrProfessor at Ecole Polytechnique, FranceDirección de correo verificada de lix.polytechnique.fr
Mario Alejandro Hevia FajardoResearch Fellow, University of BirminghamDirección de correo verificada de bham.ac.uk
Jakob BossekPaderborn UniversityDirección de correo verificada de uni-paderborn.de
Johannes LenglerETH ZürichDirección de correo verificada de inf.ethz.ch
Carola DoerrCNRS research director (DR) at Sorbonne Université, Paris, FranceDirección de correo verificada de mpi-inf.mpg.de
Dogan CorusKadir Has UniversityDirección de correo verificada de khas.edu.tr
Golnaz BadkobehCity, University of LondonDirección de correo verificada de city.ac.uk

Seguir

Dirk Sudholt

University of Passau, Germany

Dirección de correo verificada de uni-passau.de - Página principal

Theory of nature-inspired algorithms randomised algorithms natural computation evolutionary computation


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
A new method for lower bounds on the running time of evolutionary algorithms D Sudholt IEEE Transactions on Evolutionary Computation 17 (3), 418-435, 2012	163	2012
Escaping local optima using crossover with emergent diversity DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ... IEEE Transactions on Evolutionary Computation 22 (3), 484-497, 2017	130	2017
Analysis of diversity-preserving mechanisms for global exploration T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009	119	2009
Crossover is provably essential for the Ising model on trees D Sudholt Proceedings of the 7th annual conference on Genetic and evolutionary …, 2005	112	2005
The choice of the offspring population size in the (1, λ) evolutionary algorithm JE Rowe, D Sudholt Theoretical Computer Science 545, 20-38, 2014	109	2014
Parallel evolutionary algorithms D Sudholt Springer Handbook of Computational Intelligence, 929-959, 2015	90	2015
How crossover helps in pseudo-Boolean optimization T Kötzing, D Sudholt, M Theile Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011	90	2011
Running time analysis of ant colony optimization for shortest path problems D Sudholt, C Thyssen Journal of Discrete Algorithms 10, 165-180, 2012	86	2012
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus F Neumann, D Sudholt, C Witt Swarm Intelligence 3, 35-68, 2009	83	2009
Adaptive population models for offspring populations and parallel evolutionary algorithms J Lässig, D Sudholt Proceedings of the 11th workshop proceedings on Foundations of genetic …, 2011	81	2011
Mutation rate matters even when optimizing monotonic functions B Doerr, T Jansen, D Sudholt, C Winzen, C Zarges Evolutionary computation 21 (1), 1-27, 2013	79	2013
The impact of parametrization in memetic evolutionary algorithms D Sudholt Theoretical Computer Science 410 (26), 2511-2528, 2009	79	2009
Unbiased black-box complexity of parallel search G Badkobeh, PK Lehre, D Sudholt Parallel Problem Solving from Nature–PPSN XIII: 13th International …, 2014	76	2014
Escaping local optima with diversity mechanisms and crossover DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ... Proceedings of the Genetic and Evolutionary Computation Conference 2016, 645-652, 2016	69	2016
The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses D Sudholt Theory of evolutionary computation: Recent developments in discrete …, 2020	68	2020
How crossover speeds up building block assembly in genetic algorithms D Sudholt Evolutionary computation 25 (2), 237-274, 2017	66	2017
Improved evolutionary algorithm design for the project scheduling problem based on runtime analysis LL Minku, D Sudholt, X Yao IEEE Transactions on Software Engineering 40 (1), 83-102, 2013	63	2013
A simple ant colony optimizer for stochastic shortest path problems D Sudholt, C Thyssen Algorithmica 64, 643-672, 2012	56	2012
Crossover speeds up building-block assembly D Sudholt Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012	56	2012
On the runtime analysis of the 1-ANT ACO algorithm B Doerr, F Neumann, D Sudholt, C Witt Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007	56	2007

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores