default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur Guijt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Arthur Guijt
, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
Exploring the Search Space of Neural Network Combinations obtained with Efficient Model Stitching. GECCO Companion 2024: 1914-1923- [i5]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
Stitching for Neuroevolution: Recombining Deep Neural Networks without Breaking Them. CoRR abs/2403.14224 (2024) - 2023
- [j3]Laurens Bliek, Arthur Guijt, Rickard Karlsson, Sicco Verwer, Mathijs de Weerdt:
Benchmarking surrogate-based optimisation algorithms on expensive black-box functions. Appl. Soft Comput. 147: 110744 (2023) - [c4]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
The Impact of Asynchrony on Parallel Model-Based EAs. GECCO 2023: 910-918 - [i4]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
The Impact of Asynchrony on Parallel Model-Based EAs. CoRR abs/2303.15543 (2023) - 2022
- [j2]Arthur Guijt, Ngoc Hoang Luong, Peter A. N. Bosman, Mathijs de Weerdt:
On the impact of linkage learning, gene-pool optimal mixing, and non-redundant encoding on permutation optimization. Swarm Evol. Comput. 70: 101044 (2022) - [c3]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
Solving multi-structured problems by introducing linkage kernels into GOMEA. GECCO 2022: 703-711 - [d1]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
Solving multi-structured problems by introducing linkage kernels into GOMEA - Source Code. Zenodo, 2022
- [i3]Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman:
Solving Multi-Structured Problems by Introducing Linkage Kernels into GOMEA. CoRR abs/2203.05970 (2022) - 2021
- [c2]Laurens Bliek, Arthur Guijt, Rickard Karlsson:
Hospital simulation model optimisation with a random ReLU expansion surrogate model. GECCO Companion 2021: 13-14 - [c1]Laurens Bliek, Arthur Guijt, Sicco Verwer, Mathijs de Weerdt:
Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints. GECCO Companion 2021: 1851-1859 - [i2]Laurens Bliek, Arthur Guijt, Rickard Karlsson, Sicco Verwer, Mathijs de Weerdt:
EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions. CoRR abs/2106.04618 (2021)
2010 – 2019
- 2019
- [j1]Lei He, Arthur Guijt, Mathijs de Weerdt, Lining Xing, Neil Yorke-Smith:
Order acceptance and scheduling with sequence-dependent setup times: A new memetic algorithm and benchmark of the state of the art. Comput. Ind. Eng. 138 (2019) - [i1]Lei He, Arthur Guijt, Mathijs de Weerdt, Lining Xing, Neil Yorke-Smith:
Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art. CoRR abs/1910.01982 (2019)
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-10-30 21:32 CET 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:
