The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Witt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens Jägersküpper, Carsten Witt
    Rigorous runtime analysis of a (µ+1)ES for the sphere function. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:849-856 [Conf]
  2. Ingo Wegener, Carsten Witt
    On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:622-633 [Conf]
  3. Carsten Witt
    An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:761-773 [Conf]
  4. Frank Neumann, Carsten Witt
    Runtime Analysis of a Simple Ant Colony Optimization Algorithm. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:618-627 [Conf]
  5. Susanne Albers, Carsten Witt
    Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:12-23 [Conf]
  6. Carsten Witt
    Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:44-56 [Conf]
  7. Ingo Wegener, Carsten Witt
    On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:225-247 [Journal]
  8. Carsten Witt
    Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2006, v:14, n:1, pp:65-86 [Journal]
  9. Ingo Wegener, Carsten Witt
    On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:61-78 [Journal]
  10. Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
    On the runtime analysis of the 1-ANT ACO algorithm. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:33-40 [Conf]
  11. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
    Approximating covering problems by randomized search heuristics using multi-objective models. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:797-804 [Conf]
  12. Frank Neumann, Dirk Sudholt, Carsten Witt
    Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:61-75 [Conf]
  13. Jörn Mehnen, Thomas Michelitsch, Carsten Witt
    Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis). [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2007, v:49, n:1, pp:49-0 [Journal]

  14. Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. [Citation Graph (, )][DBLP]


  15. Runtime Analysis of a Simple Ant Colony Optimization Algorithm. [Citation Graph (, )][DBLP]


  16. Runtime analysis of binary PSO. [Citation Graph (, )][DBLP]


  17. Theoretical analysis of diversity mechanisms for global exploration. [Citation Graph (, )][DBLP]


  18. Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. [Citation Graph (, )][DBLP]


  19. Theoretical analysis of fitness-proportional selection: landscapes and efficiency. [Citation Graph (, )][DBLP]


  20. Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. [Citation Graph (, )][DBLP]


  21. A few ants are enough: ACO with iteration-best update. [Citation Graph (, )][DBLP]


  22. Quasirandom evolutionary algorithms. [Citation Graph (, )][DBLP]


  23. Black-box search by unbiased variation. [Citation Graph (, )][DBLP]


  24. Theory of randomised search heuristics in combinatorial optimisation. [Citation Graph (, )][DBLP]


  25. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. [Citation Graph (, )][DBLP]


  26. Greedy Local Search and Vertex Cover in Sparse Random Graphs. [Citation Graph (, )][DBLP]


  27. On improving approximate solutions by evolutionary algorithms. [Citation Graph (, )][DBLP]


  28. Ant Colony Optimization and the Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  29. Runtime Analysis of a Simple Ant Colony Optimization Algorithm. [Citation Graph (, )][DBLP]


  30. A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. [Citation Graph (, )][DBLP]


  31. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. [Citation Graph (, )][DBLP]


  32. Ingo Wegener. [Citation Graph (, )][DBLP]


  33. Analysis of Diversity-Preserving Mechanisms for Global Exploration. [Citation Graph (, )][DBLP]


  34. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. [Citation Graph (, )][DBLP]


  35. Ant Colony Optimization and the Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  36. Runtime Analysis of a Simple Ant Colony Optimization Algorithm. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002