Carsten Witt

Citado por

	Total	Desde 2019
Citas	4994	2234
Índice h	41	27
Índice i10	72	62

460

230

115

345

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202419 52 31 32 73 94 146 128 202 207 261 240 246 223 342 368 445 431 415 329 445 165

Acceso público

Ver todo

54 artículos

6 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Frank NeumannOptimisation and Logistics, School of ComputerDirección de correo verificada de adelaide.edu.au
Dirk SudholtUniversity of Passau, GermanyDirección de correo verificada de uni-passau.de
Pietro S. OlivetoProfessor of Computer Science, Chair in Algorithms, The University of SheffieldDirección de correo verificada de sheffield.ac.uk
Benjamin DoerrProfessor at Ecole Polytechnique, FranceDirección de correo verificada de lix.polytechnique.fr
Andrei LissovoiResearch Associate, University of SheffieldDirección de correo verificada de sheffield.ac.uk
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
Christian GießenContinental AGDirección de correo verificada de giessen.io
Jun HeNottingham Trent UniversityDirección de correo verificada de ntu.ac.uk
Martin S. KrejcaLIX, CNRS, Ecole Polytechnique, IPPDirección de correo verificada de polytechnique.edu
Thomas JansenAberystwyth UniversityDirección de correo verificada de aber.ac.uk
Johannes LenglerETH ZürichDirección de correo verificada de inf.ethz.ch
Heiko RöglinProfessor of Computer Science, University of BonnDirección de correo verificada de cs.uni-bonn.de
Christine ZargesDepartment of Computer Science, Aberystwyth UniversityDirección de correo verificada de aber.ac.uk
Susanne AlbersProfessor of Computer Science, TU MuenchenDirección de correo verificada de in.tum.de
Hsien-Kuei HwangDistinguished Research Fellow, Institute of Statistical Science, Academia SinicaDirección de correo verificada de stat.sinica.edu.tw
Paul FischerDTU Compute, Technical University of DenmarkDirección de correo verificada de dtu.dk
Xin YaoLingnan University (Hong Kong) and University of Birmingham (UK)

Seguir

Carsten Witt

Technical University of Denmark

Dirección de correo verificada de imm.dtu.dk

Theoretical Computer Science Randomized Algorithms Search Heuristics


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Bioinspired Computation in Combinatorial Optimization - Combinatorial optimization and computational complexity F Neumann, C Witt Springer, Berlin, Heidelberg, 2010	503*	2010
Runtime analysis of the (μ+ 1) EA on simple pseudo-Boolean functions C Witt Evolutionary Computation 14 (1), 65-86, 2006	237*	2006
Black-box search by unbiased variation PK Lehre, C Witt Proceedings of the 12th annual conference on Genetic and evolutionary …, 2010	221	2010
Worst-case and average-case approximations by simple randomized search heuristics C Witt Annual Symposium on Theoretical Aspects of Computer Science, 44-56, 2005	189	2005
Tight bounds on the optimization time of a randomized search heuristic on linear functions C Witt Combinatorics, Probability and Computing 22 (02), 294-318, 2013	181	2013
Simplified drift analysis for proving lower bounds in evolutionary computation PS Oliveto, C Witt Algorithmica 59 (3), 369-386, 2011	180	2011
Approximating covering problems by randomized search heuristics using multi-objective models T Friedrich, N Hebbinghaus, F Neumann, J He, C Witt Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007	177	2007
Improved time complexity analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 605, 21-41, 2015	126	2015
Analysis of diversity-preserving mechanisms for global exploration* T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009	120	2009
Ant colony optimization and the minimum spanning tree problem F Neumann, C Witt Theoretical Computer Science 411 (25), 2406-2413, 2010	112	2010
Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006	100	2006
On the optimization of monotone polynomials by simple randomized search heuristics I Wegener, C Witt Combinatorics, Probability and Computing 14 (1-2), 225-247, 2005	98*	2005
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus F Neumann, D Sudholt, C Witt Swarm Intelligence 3 (1), 35-68, 2009	97*	2009
Concentrated hitting times of randomized search heuristics with variable drift PK Lehre, C Witt International Symposium on Algorithms and Computation, 686-697, 2014	91*	2014
Population size versus runtime of a simple evolutionary algorithm C Witt Theoretical Computer Science 403 (1), 104-120, 2008	89*	2008
On the runtime analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 545, 2-19, 2014	85*	2014
Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt Algorithmica 54 (2), 243-255, 2009	84	2009
A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability J He, C Reeves, C Witt, X Yao Evolutionary Computation 15 (4), 435-443, 2007	80	2007
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions I Wegener, C Witt Journal of Discrete Algorithms 3 (1), 61-78, 2005	78*	2005
Theoretical analysis of fitness-proportional selection: landscapes and efficiency F Neumann, PS Oliveto, C Witt Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009	77	2009

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