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 22 matches
- 2011
- Dirk V. Arnold:
On the behaviour of the (1, λ)-es for a simple constrained problem. FOGA 2011: 15-24 - Anne Auger, Dimo Brockhoff, Nikolaus Hansen:
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies. FOGA 2011: 127-138 - Jeffrey Kermes Bassett, Kenneth A. De Jong:
Using multivariate quantitative genetics theory to assist in EA customization. FOGA 2011: 219-230 - Nicola Beume, Marco Laumanns, Günter Rudolph:
Convergence rates of SMS-EMOA on continuous bi-objective problem classes. FOGA 2011: 243-252 - Stephan Cathabard, Per Kristian Lehre, Xin Yao:
Non-uniform mutation rates for problems with unknown solution lengths. FOGA 2011: 173-180 - Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud:
Handling expensive optimization with large noise. FOGA 2011: 61-68 - Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster black-box algorithms through higher arity operators. FOGA 2011: 163-172 - Benjamin Doerr, Daniel Johannsen, Martin Schmidt:
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA 2011: 119-126 - Greg Durrett, Frank Neumann, Una-May O'Reilly:
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. FOGA 2011: 69-80 - Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel:
The logarithmic hypervolume indicator. FOGA 2011: 81-92 - Thomas Jansen, Christine Zarges:
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. FOGA 2011: 1-14 - Lars Kaden, Nicole Weicker, Karsten Weicker:
The role of selective pressure when solving symmetric functions in polynomial time. FOGA 2011: 105-118 - Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner:
Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA 2011: 209-218 - William B. Langdon:
Elementary bit string mutation landscapes. FOGA 2011: 25-42 - Jörg Lässig, Dirk Sudholt:
Adaptive population models for offspring populations and parallel evolutionary algorithms. FOGA 2011: 181-192 - Luigi Malagò, Matteo Matteucci, Giovanni Pistone:
Towards the geometry of estimation of distribution algorithms based on the exponential family. FOGA 2011: 230-242 - Alberto Moraglio:
Abstract convex evolutionary search. FOGA 2011: 151-162 - Elena Popovici, Ezra Winston, Anthony Bucci:
On the practicality of optimal output mechanisms for co-optimization algorithms. FOGA 2011: 43-60 - Dirk Sudholt:
Using markov-chain mixing time estimates for the analysis of ant colony optimization. FOGA 2011: 139-150 - Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Approximating the distribution of fitness over hamming regions. FOGA 2011: 93-104 - Alden H. Wright, Tomás Gedeon, J. Neal Richter:
On the movement of vertex fixed points in the simple GA. FOGA 2011: 193-208 - Hans-Georg Beyer, William B. Langdon:
Foundations of Genetic Algorithms, 11th International Workshop, FOGA 2011, Schwarzenberg, Austria, January 5-8, 2011, Proceedings. ACM 2011, ISBN 978-1-4503-0633-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-10-16 21:12 CEST 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