![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 13 | 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) | |
| 9 | 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) | |
| 8 | Stefan Droste, Thomas Jansen, Ingo Wegener: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2): 51-81 (2002) | |
| 7 | 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) | |
| 5 | Stefan Droste, Dominic Heutelbeck, Ingo Wegener: Distributed Hybrid Genetic Programming for Learning Boolean Functions. PPSN 2000: 181-190 | |
| 4 | Stefan Droste, Thomas Jansen, Ingo Wegener: Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO 1999: 833-839 | |
| 3 | Stefan Droste, Thomas Jansen, Ingo Wegener: On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN 1998: 13-22 | |
| 2 | 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) |
Selection of 8 from 15 records - Stefan Droste has 5 coauthors
Copyright © 2009-12-01 by Michael Ley (ley@uni-trier.de)