![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 24 matches
- 2012
- Anne Auger, Nikolaus Hansen
, Marc Schoenauer
:
Benchmarking of Continuous Black Box Optimization Algorithms. Evol. Comput. 20(4): 481 (2012) - Bernd Bischl, Olaf Mersmann
, Heike Trautmann, Claus Weihs:
Resampling Methods for Meta-Model Validation with Recommendations for Evolutionary Computation. Evol. Comput. 20(2): 249-275 (2012) - Noureddine Bouhmala:
A Multilevel Memetic Algorithm for Large SAT-Encoded Problems. Evol. Comput. 20(4): 641-664 (2012) - Edmund K. Burke
, Matthew R. Hyde, Graham Kendall
, John R. Woodward:
Automating the Packing Heuristic Design Process with Genetic Programming. Evol. Comput. 20(1): 63-89 (2012) - Kalyanmoy Deb, Amit Saha:
Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm. Evol. Comput. 20(1): 27-62 (2012) - Alexandre Devert, Thomas Weise, Ke Tang:
A Study on Scalable Representations for Evolutionary Optimization of Ground Structures. Evol. Comput. 20(3): 453-472 (2012) - Walter J. Gutjahr
:
Runtime Analysis of an Evolutionary Algorithm for Stochastic Multi-Objective Combinatorial Optimization. Evol. Comput. 20(3): 395-421 (2012) - David Hadka, Patrick M. Reed:
Diagnostic Assessment of Search Controls and Failure Modes in Many-Objective Evolutionary Optimization. Evol. Comput. 20(3): 423-452 (2012) - Mark Hauschild, Martin Pelikan
, Kumara Sastry, David E. Goldberg:
Using Previous Models to Bias Structural Learning in the Hierarchical BOA. Evol. Comput. 20(1): 135-160 (2012) - Jing Liu, Hussein A. Abbass
, David G. Green
, Weicai Zhong:
Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs. Evol. Comput. 20(3): 321-347 (2012) - Kent McClymont, Ed Keedwell:
Deductive Sort and Climbing Sort: New Methods for Non-Dominated Sorting. Evol. Comput. 20(1): 1-26 (2012) - R. Morgan, Marcus Gallagher
:
Using Landscape Topology to Compare Continuous Metaheuristics: A Framework and Case Study on EDAs and Ridge Structure. Evol. Comput. 20(2): 277-299 (2012) - Jean-Baptiste Mouret
, Stéphane Doncieux:
Encouraging Behavioral Diversity in Evolutionary Robotics: An Empirical Study. Evol. Comput. 20(1): 91-133 (2012) - Christian L. Müller, Ivo F. Sbalzarini
:
Energy Landscapes of Atomic Clusters as Black Box Optimization Benchmarks. Evol. Comput. 20(4): 543-573 (2012) - Gabriela Ochoa
, Mike Preuss
, Thomas Bartz-Beielstein
, Marc Schoenauer
:
Editorial for the Special Issue on Automated Design and Assessment of Heuristic Search Methods. Evol. Comput. 20(2): 161-163 (2012) - László Pál, Tibor Csendes, Mihály Csaba Markót
, Arnold Neumaier
:
Black Box Optimization Benchmarking of the GLOBAL Method. Evol. Comput. 20(4): 609-639 (2012) - Petr Posík, Waltraud Huyer:
Restarted Local Search Algorithms for Continuous Black Box Optimization. Evol. Comput. 20(4): 575-607 (2012) - Petr Posík, Waltraud Huyer, László Pál:
A Comparison of Global Search Algorithms for Continuous Black Box Optimization. Evol. Comput. 20(4): 509-541 (2012) - Petr Posík, Jirí Kubalík:
Experimental Comparison of Six Population-Based Algorithms for Continuous Black Box Optimization. Evol. Comput. 20(4): 483-508 (2012) - Zhilei Ren, He Jiang, Jifeng Xuan
, Zhongxuan Luo:
Hyper-Heuristics with Low Level Parameter Adaptation. Evol. Comput. 20(2): 189-227 (2012) - Shade T. Shutters
:
Punishment Leads to Cooperative Behavior in Structured Societies. Evol. Comput. 20(2): 301-319 (2012) - J. E. Smith:
Estimating Meme Fitness in Adaptive Memetic Algorithms for Combinatorial Problems. Evol. Comput. 20(2): 165-188 (2012) - Jun Sun, Wei Fang, Xiaojun Wu, Vasile Palade
, Wenbo Xu:
Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection. Evol. Comput. 20(3): 349-393 (2012) - Tobias Wagner, Simon Wessing:
On the Effect of Response Transformations in Sequential Parameter Optimization. Evol. Comput. 20(2): 229-248 (2012)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-19 10:58 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