Остановите войну!
for scientists:
default search action
Stefan Droste
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 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. Nat. Comput. 5(3): 257-283 (2006) - [c12]Lothar M. Schmitt, Stefan Droste:
Convergence to global optima for genetic programming systems with dynamically scaled operators. GECCO 2006: 879-886 - 2005
- [c11]Stefan Droste:
Not all linear functions are equally difficult for the compact genetic algorithm. GECCO 2005: 679-686 - 2004
- [c10]Stefan Droste:
Analysis of the (1+1) EA for a Noisy OneMax. GECCO (1) 2004: 1088-1099 - 2003
- [c9]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. Electron. Colloquium Comput. Complex. TR03 (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) - [c8]Stefan Droste:
Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant. IEEE Congress on Evolutionary Computation 2002: 55-60 - [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
- [b1]Stefan Droste:
Zu Analyse und Entwurf evolutionärer Algorithmen. Technical University of Dortmund, Germany, 2000, pp. 1-166 - [c6]Stefan Droste, Dirk Wiesmann:
Metric Based Evolutionary Algorithms. EuroGP 2000: 29-43 - [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
1990 – 1999
- 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. Evol. Comput. 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]Stefan Droste:
New Results on Visual Cryptography. CRYPTO 1996: 401-415
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint