default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSander van Rijn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j1]Sander van Rijn
, Sebastian Schmitt:
MF2: A Collection of Multi-Fidelity Benchmark Functions in Python. J. Open Source Softw. 5(52): 2049 (2020)
Conference and Workshop Papers
- 2019
- [c7]Diederick Vermetten, Sander van Rijn, Thomas Bäck, Carola Doerr:
Online selection of CMA-ES variants. GECCO 2019: 951-959 - 2018
- [c6]Sander van Rijn, Sebastian Schmitt, Markus Olhofer, Matthijs van Leeuwen, Thomas Bäck:
Multi-fidelity surrogate model approach to optimization. GECCO (Companion) 2018: 225-226 - [c5]Carola Doerr, Furong Ye, Sander van Rijn, Hao Wang, Thomas Bäck:
Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1 + λ) EA variants on onemax and leadingones. GECCO 2018: 951-958 - [c4]Sander van Rijn, Carola Doerr, Thomas Bäck:
Towards an Adaptive CMA-ES Configurator. PPSN (1) 2018: 54-65 - 2017
- [c3]Sander van Rijn, Hao Wang, Bas van Stein, Thomas Bäck:
Algorithm configuration data mining for CMA evolution strategies. GECCO 2017: 737-744 - 2016
- [c2]Sander van Rijn, Hao Wang, Matthijs van Leeuwen, Thomas Bäck:
Evolving the structure of Evolution Strategies. SSCI 2016: 1-8 - 2015
- [c1]Sander van Rijn, Michael T. M. Emmerich, Edgar Reehuis, Thomas Bäck:
Optimizing Highly Constrained Truck Loadings Using a Self-Adaptive Genetic Algorithm. CEC 2015: 227-234
Data and Artifacts
- 2022
- [d2]Sander van Rijn, Sebastian Schmitt, Matthijs van Leeuwen, Thomas Bäck:
Finding Efficient Trade-offs in Multi-Fidelity Response Surface Modeling: Generated data files and figures. Version v2. Zenodo, 2022 [all versions]
- 2021
- [d1]Sander van Rijn, Sebastian Schmitt, Matthijs van Leeuwen, Thomas Bäck:
Finding Efficient Trade-offs in Multi-Fidelity Response Surface Modeling: Generated data files and figures. Version v1. Zenodo, 2021 [all versions]
Informal and Other Publications
- 2021
- [i5]Sander van Rijn, Sebastian Schmitt, Matthijs van Leeuwen, Thomas Bäck:
Finding Efficient Trade-offs in Multi-Fidelity Response Surface Modeling. CoRR abs/2103.03280 (2021) - 2019
- [i4]Diederick Vermetten, Sander van Rijn, Thomas Bäck, Carola Doerr:
Online Selection of CMA-ES Variants. CoRR abs/1904.07801 (2019) - 2018
- [i3]Carola Doerr, Furong Ye, Sander van Rijn, Hao Wang, Thomas Bäck:
Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box Optimization Heuristics: Profiling (1+λ) EA Variants on OneMax and LeadingOnes. CoRR abs/1808.05850 (2018) - [i2]Carola Doerr, Hao Wang, Furong Ye, Sander van Rijn, Thomas Bäck:
IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs/1810.05281 (2018) - 2016
- [i1]Sander van Rijn, Hao Wang, Matthijs van Leeuwen, Thomas Bäck:
Evolving the Structure of Evolution Strategies. CoRR abs/1610.05231 (2016)
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-06-19 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
