default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 15 matches
- 2017
- Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck:
Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA 2017: 45-54 - Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - Youhei Akimoto, Anne Auger, Nikolaus Hansen:
Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions. FOGA 2017: 111-126 - Asma Atamna, Anne Auger, Nikolaus Hansen:
Linearly Convergent Evolution Strategies via Augmented Lagrangian Constraint Handling. FOGA 2017: 149-161 - Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems. FOGA 2017: 95-110 - Oswin Krause, Tobias Glasmachers, Christian Igel:
Qualitative and Quantitative Assessment of Step Size Adaptation Rules. FOGA 2017: 139-148 - Martin S. Krejca, Carsten Witt:
Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. FOGA 2017: 65-79 - Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, Rolf Wanka:
Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. FOGA 2017: 13-24 - Edgar Covantes Osuna, Dirk Sudholt:
Analysis of the Clearing Diversity-Preserving Mechanism. FOGA 2017: 55-63 - Tiago Paixão, Jorge Pérez Heredia:
An Application of Stochastic Differential Equations to Evolutionary Algorithms. FOGA 2017: 3-11 - Mojgan Pourhassan, Tobias Friedrich, Frank Neumann:
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA 2017: 37-44 - Ofer M. Shir, Amir Yehudayoff:
On the Statistical Learning Ability of Evolution Strategies. FOGA 2017: 127-138 - Shane Strasser, John W. Sheppard:
Convergence of Factored Evolutionary Algorithms. FOGA 2017: 81-94 - Mikkel Thorup:
Fast and Powerful Hashing using Tabulation. FOGA 2017: 1 - Christian Igel, Dirk Sudholt, Carsten Witt:
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2017, Copenhagen, Denmark, January 12-15, 2017. ACM 2017, ISBN 978-1-4503-4651-1 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-13 19:28 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint