dblp.uni-trier.dewww.uni-trier.de

Carsten Witt

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
26EEFrank Neumann, Dirk Sudholt, Carsten Witt: Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference 2008: 132-143
25EEDirk Sudholt, Carsten Witt: Runtime analysis of binary PSO. GECCO 2008: 135-142
24EETobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt: Theoretical analysis of diversity mechanisms for global exploration. GECCO 2008: 945-952
23EECarsten Witt: Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. GECCO (Companion) 2008: 2907-2946
22EEPietro Simone Oliveto, Carsten Witt: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. PPSN 2008: 82-91
21EECarsten Witt: Population size versus runtime of a simple evolutionary algorithm. Theor. Comput. Sci. 403(1): 104-120 (2008)
2007
20EEBenjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
19EETobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804
18EETobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621
17EEFrank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166
16EEFrank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75
15EETobias 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) 14(027): (2007)
14EEJun He, Colin R. Reeves, Carsten Witt, Xin Yao: A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. Evolutionary Computation 15(4): 435-443 (2007)
13EEJö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 49(1): 49- (2007)
2006
12EEFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627
11EEFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006
10EEFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084): (2006)
9EEFrank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(143): (2006)
8EECarsten Witt: Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. Evolutionary Computation 14(1): 65-86 (2006)
2005
7EEJens Jägersküpper, Carsten Witt: Rigorous runtime analysis of a (µ+1)ES for the sphere function. GECCO 2005: 849-856
6EECarsten Witt: Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. STACS 2005: 44-56
5EEIngo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Combinatorics, Probability & Computing 14(1-2): 225-247 (2005)
4EEIngo Wegener, Carsten Witt: On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms 3(1): 61-78 (2005)
2004
3EECarsten Witt: An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. GECCO (1) 2004: 761-773
2003
2EEIngo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO 2003: 622-633
2001
1EESusanne Albers, Carsten Witt: Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX 2001: 12-23

Coauthor Index

1Susanne Albers [1]
2Benjamin Doerr [20]
3Tobias Friedrich [15] [18] [19] [24]
4Jun He [14] [15] [18] [19]
5Nils Hebbinghaus [15] [18] [19]
6Jens Jägersküpper [7]
7Jörn Mehnen [13]
8Thomas Michelitsch [13]
9Frank Neumann [9] [10] [11] [12] [15] [16] [17] [18] [19] [20] [26]
10Pietro Simone Oliveto [22] [24]
11Colin R. Reeves [14]
12Dirk Sudholt [16] [20] [24] [25] [26]
13Ingo Wegener [2] [4] [5]
14Xin Yao [14]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)