| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt |
Theoretical analysis of two ACO approaches for the traveling salesman problem.  |
Swarm Intelligence  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
Runtime analysis of the 1-ANT ant colony optimizer. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pietro Simone Oliveto, Carsten Witt |
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Per Kristian Lehre, Carsten Witt |
Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
Sharp bounds by probability-generating functions and variable drift. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Theory of randomized search heuristics in combinatorial optimization. |
GECCO (Companion) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Ebbesen, Paul Fischer, Carsten Witt |
Edge-Matching Problems with Rotations. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Kristian Lehre, Carsten Witt |
Black-Box Search by Unbiased Variation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Ant Colony Optimization and the minimum spanning tree problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Sudholt, Carsten Witt |
Runtime analysis of a binary particle swarm optimizer. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. |
Evolutionary Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Dirk Sudholt, Carsten Witt |
A few ants are enough: ACO with iteration-best update. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
iteration-best update, theory, ant colony optimization, runtime analysis |
| 1 | Per Kristian Lehre, Carsten Witt |
Black-box search by unbiased variation. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
black-box complexity, runtime analysis |
| 1 | Carsten Witt |
Theory of randomised search heuristics in combinatorial optimisation. |
GECCO (Companion) |
2010 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, theory, runtime analysis, randomized search heuristics |
| 1 | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
Quasirandom evolutionary algorithms. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
quasirandomness, evolutionary algorithms |
| 1 | Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt |
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. |
ANTS Conference |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Dirk Sudholt, Carsten Witt |
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. |
Swarm Intelligence |
2009 |
DBLP DOI BibTeX RDF |
MMAS, Theory, Ant colony optimization, Runtime analysis |
| 1 | Frank Neumann, Carsten Witt |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Ant colony optimization, Runtime analysis, Randomized search heuristics |
| 1 | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. |
Evolutionary Computation |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges |
Ingo Wegener. |
Evolutionary Computation |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt |
Analysis of Diversity-Preserving Mechanisms for Global Exploration. |
Evolutionary Computation |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Dirk Sudholt, Carsten Witt |
Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. |
Innovations in Swarm Intelligence |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, theory, runtime analysis, tutorial, combinatorial optimisation |
| 1 | Frank Neumann, Pietro Simone Oliveto, Carsten Witt |
Theoretical analysis of fitness-proportional selection: landscapes and efficiency. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
genetic algorithms, theory, selection, running time analysis |
| 1 | Carsten Witt |
Greedy Local Search and Vertex Cover in Sparse Random Graphs. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Why standard particle swarm optimisers elude a theoretical runtime analysis. |
FOGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Population size versus runtime of a simple evolutionary algorithm. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pietro Simone Oliveto, Carsten Witt |
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. |
PPSN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. |
GECCO (Companion) |
2008 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, theory, runtime analysis, tutorial, combinatorial optimisation |
| 1 | Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt |
Theoretical analysis of diversity mechanisms for global exploration. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
deterministic crowding, diversity, exploration, runtime analysis, fitness sharing |
| 1 | Dirk Sudholt, Carsten Witt |
Runtime analysis of binary PSO. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
particle swarm optimization, runtime analysis |
| 1 | Frank Neumann, Dirk Sudholt, Carsten Witt |
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. |
ANTS Conference |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jun He, Colin R. Reeves, Carsten Witt, Xin Yao |
A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. |
Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörn Mehnen, Thomas Michelitsch, Carsten Witt |
Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis). |
it - Information Technology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt |
Approximating covering problems by randomized search heuristics using multi-objective models. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
combinatorial optimization, multi-objective optimization, runtime analysis, covering problems |
| 1 | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
On the runtime analysis of the 1-ANT ACO algorithm. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
ant colony optimization, runtime analysis |
| 1 | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
On improving approximate solutions by evolutionary algorithms. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Ant Colony Optimization and the Minimum Spanning Tree Problem. |
LION |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Dirk Sudholt, Carsten Witt |
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Ant Colony Optimization and the Minimum Spanning Tree Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Carsten Witt |
Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. |
Evolutionary Computation |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm. |
Theory of Evolutionary Algorithms |
2006 |
DBLP BibTeX RDF |
|
| 1 | Frank Neumann, Carsten Witt |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Wegener, Carsten Witt |
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Wegener, Carsten Witt |
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. |
J. Discrete Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Jägersküpper, Carsten Witt |
Rigorous runtime analysis of a (µ+1)ES for the sphere function. |
GECCO |
2005 |
DBLP DOI BibTeX RDF |
sphere function, evolution strategies, runtime analysis |
| 1 | Carsten Witt |
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung. |
|
2004 |
RDF |
|
| 1 | Carsten Witt |
An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. |
GECCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Wegener, Carsten Witt |
On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. |
GECCO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Carsten Witt |
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")