| 2006 | ||
|---|---|---|
| j5 | Stefan Droste, Thomas Jansen, Ingo Wegener: Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39(4): 525-544 (2006) | |
| j4 | Stefan Droste: A rigorous analysis of the compact genetic algorithm for linear functions. Natural Computing 5(3): 257-283 (2006) | |
| c11 | Lothar M. Schmitt, Stefan Droste: Convergence to global optima for genetic programming systems with dynamically scaled operators. GECCO 2006: 879-886 | |
| 2005 | ||
| c10 | Stefan Droste: Not all linear functions are equally difficult for the compact genetic algorithm. GECCO 2005: 679-686 | |
| 2004 | ||
| c9 | ||
| 2003 | ||
| c8 | Stefan Droste: Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax. GECCO 2003: 909-921 | |
| i1 | Stefan Droste, Thomas Jansen, Ingo Wegener: Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Electronic Colloquium on Computational Complexity (ECCC)(048) (2003) | |
| 2002 | ||
| j3 | Stefan Droste, Thomas Jansen, Ingo Wegener: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2): 51-81 (2002) | |
| j2 | Stefan Droste, Thomas Jansen, Ingo Wegener: Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci. 287(1): 131-144 (2002) | |
| c7 | Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener: A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA 2002: 253-270 | |
| 2000 | ||
| c6 | ||
| c5 | Stefan Droste, Thomas Jansen, Ingo Wegener: Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA 2000: 275-294 | |
| c4 | Stefan Droste, Dominic Heutelbeck, Ingo Wegener: Distributed Hybrid Genetic Programming for Learning Boolean Functions. PPSN 2000: 181-190 | |
| 1999 | ||
| c3 | Stefan Droste, Thomas Jansen, Ingo Wegener: Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO 1999: 833-839 | |
| 1998 | ||
| j1 | Stefan Droste, Thomas Jansen, Ingo Wegener: A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evolutionary Computation 6(2): 185-196 (1998) | |
| c2 | Stefan Droste, Thomas Jansen, Ingo Wegener: On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN 1998: 13-22 | |
| 1996 | ||
| c1 | ||
| 1 | Dominic Heutelbeck | |
| 2 | Thomas Jansen | |
| 3 | Lothar M. Schmitt | |
| 4 | Karsten Tinnefeld | |
| 5 | Ingo Wegener | |
| 6 | Dirk Wiesmann |
Data released under the ODC-BY 1.0 license — See also our legal information page