Search the dblp DataBase
Stefan Droste :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Stefan Droste New Results on Visual Cryptography. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1996, pp:401-415 [Conf ] Stefan Droste , Dirk Wiesmann Metric Based Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP ] EuroGP, 2000, pp:29-43 [Conf ] Stefan Droste Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax. [Citation Graph (0, 0)][DBLP ] GECCO, 2003, pp:909-921 [Conf ] Stefan Droste Analysis of the (1+1) EA for a Noisy OneMax. [Citation Graph (0, 0)][DBLP ] GECCO (1), 2004, pp:1088-1099 [Conf ] Stefan Droste Not all linear functions are equally difficult for the compact genetic algorithm. [Citation Graph (0, 0)][DBLP ] GECCO, 2005, pp:679-686 [Conf ] Stefan Droste , Thomas Jansen , Ingo Wegener Perhaps Not a Free Lunch But At Least a Free Appetizer. [Citation Graph (0, 0)][DBLP ] GECCO, 1999, pp:833-839 [Conf ] Lothar M. Schmitt , Stefan Droste Convergence to global optima for genetic programming systems with dynamically scaled operators. [Citation Graph (0, 0)][DBLP ] GECCO, 2006, pp:879-886 [Conf ] Stefan Droste , Dominic Heutelbeck , Ingo Wegener Distributed Hybrid Genetic Programming for Learning Boolean Functions. [Citation Graph (0, 0)][DBLP ] PPSN, 2000, pp:181-190 [Conf ] Stefan Droste , Thomas Jansen , Ingo Wegener On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP ] PPSN, 1998, pp:13-22 [Conf ] Stefan Droste , Thomas Jansen , Ingo Wegener A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. [Citation Graph (0, 0)][DBLP ] Evolutionary Computation, 1998, v:6, n:2, pp:185-196 [Journal ] Stefan Droste , Thomas Jansen , Ingo Wegener Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:048, pp:- [Journal ] Stefan Droste , Thomas Jansen , Ingo Wegener Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:4, pp:525-544 [Journal ] Stefan Droste A rigorous analysis of the compact genetic algorithm for linear functions. [Citation Graph (0, 0)][DBLP ] Natural Computing, 2006, v:5, n:3, pp:257-283 [Journal ] Stefan Droste , Thomas Jansen , Ingo Wegener On the analysis of the (1+1) evolutionary algorithm. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:51-81 [Journal ] Stefan Droste , Thomas Jansen , Ingo Wegener Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:287, n:1, pp:131-144 [Journal ] Search in 0.002secs, Finished in 0.002secs