Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Kalkreuth
Person information
- affiliation: Sorbonne University, Lip6, Paris, France
- affiliation: Leiden University, The Netherlands
- affiliation (PhD 2021): Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Kirill Antonov, Roman Kalkreuth, Kaifeng Yang, Thomas Bäck, Niki van Stein, Anna V. Kononova:
A Functional Analysis Approach to Symbolic Regression. CoRR abs/2402.06299 (2024)- 2023
- [j2]Thomas H. W. Bäck
, Anna V. Kononova, Bas van Stein, Hao Wang, Kirill A. Antonov, Roman T. Kalkreuth, Jacob de Nobel, Diederick Vermetten, Roy de Winter, Furong Ye:
Evolutionary Algorithms for Parameter Optimization - Thirty Years Later. Evol. Comput. 31(2): 81-122 (2023) - [c19]Roman Kalkreuth, Zdenek Vasícek, Jakub Husa, Diederick Vermetten, Furong Ye, Thomas Bäck:
General Boolean Function Benchmark Suite. FOGA 2023: 84-95 - [c18]Roman Kalkreuth, Zdenek Vasícek, Jakub Husa, Diederick Vermetten, Furong Ye, Thomas Bäck:
Towards a General Boolean Function Benchmark Suite. GECCO Companion 2023: 591-594 - [c17]Fu Xing Long, Diederick Vermetten, Anna V. Kononova, Roman Kalkreuth, Kaifeng Yang, Thomas Bäck, Niki van Stein:
Challenges of ELA-Guided Function Evolution Using Genetic Programming. IJCCI 2023: 119-130 - [i3]Fu Xing Long, Diederick Vermetten, Anna V. Kononova, Roman Kalkreuth, Kaifeng Yang, Thomas Bäck, Niki van Stein:
Challenges of ELA-guided Function Evolution using Genetic Programming. CoRR abs/2305.15245 (2023) - 2022
- [c16]Marco Pleines, Konstantin Ramthun, Yannik Wegener, Hendrik Meyer, Matthias Pallasch, Sebastian Prior, Jannik Drögemüller, Leon Büttinghaus, Thilo Röthemeyer, Alexander Kaschwig, Oliver Chmurzynski, Frederik Rohkrähmer, Roman Kalkreuth, Frank Zimmer, Mike Preuss:
On the Verge of Solving Rocket League using Deep Reinforcement Learning and Sim-to-sim Transfer. CoG 2022: 253-260 - [c15]Roman Kalkreuth:
Phenotypic duplication and inversion in cartesian genetic programming applied to boolean function learning. GECCO Companion 2022: 566-569 - [c14]Roman Kalkreuth, Léo Françoso Dal Piccol Sotto, Zdenek Vasícek:
Graph-based genetic programming. GECCO Companion 2022: 958-982 - [c13]Roman Kalkreuth:
Towards Phenotypic Duplication and Inversion in Cartesian Genetic Programming. IJCCI 2022: 50-61 - [c12]Roman Kalkreuth:
Towards Discrete Phenotypic Recombination in Cartesian Genetic Programming. PPSN (2) 2022: 63-77 - [i2]Marco Pleines, Konstantin Ramthun, Yannik Wegener, Hendrik Meyer, Matthias Pallasch, Sebastian Prior, Jannik Drögemüller, Leon Büttinghaus, Thilo Röthemeyer, Alexander Kaschwig, Oliver Chmurzynski, Frederik Rohkrähmer, Roman Kalkreuth, Frank Zimmer, Mike Preuss:
On the Verge of Solving Rocket League using Deep Reinforcement Learning and Sim-to-sim Transfer. CoRR abs/2205.05061 (2022) - 2021
- [b1]Roman Kalkreuth:
Reconsideration and extension of Cartesian genetic programming. Technical University of Dortmund, Germany, 2021 - [j1]Léo Françoso Dal Piccol Sotto, Paul Kaufmann, Timothy Atkinson, Roman Kalkreuth, Márcio Porto Basgalupp:
Graph representations in genetic programming. Genet. Program. Evolvable Mach. 22(4): 607-636 (2021) - 2020
- [c11]Paul Kaufmann, Roman Kalkreuth:
On the Parameterization of Cartesian Genetic Programming. CEC 2020: 1-8 - [c10]Léo Françoso Dal Piccol Sotto, Paul Kaufmann, Timothy Atkinson, Roman Kalkreuth, Márcio Porto Basgalupp:
A study on graph representations for genetic programming. GECCO 2020: 931-939 - [c9]Roman Kalkreuth:
A Comprehensive Study on Subgraph Crossover in Cartesian Genetic Programming. IJCCI 2020: 59-70
2010 – 2019
- 2019
- [c8]Roman Kalkreuth:
Two New Mutation Techniques for Cartesian Genetic Programming. IJCCI 2019: 82-92 - [c7]Roman Kalkreuth, Andre Droschinsky:
On the Time Complexity of Simple Cartesian Genetic Programming. IJCCI 2019: 172-179 - 2018
- [c6]Jakub Husa, Roman Kalkreuth:
A Comparative Study on Crossover in Cartesian Genetic Programming. EuroGP 2018: 203-219 - [i1]Roman Kalkreuth:
Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming. CoRR abs/1803.06127 (2018) - 2017
- [c5]Roman Kalkreuth, Günter Rudolph, Andre Droschinsky:
A New Subgraph Crossover for Cartesian Genetic Programming. EuroGP 2017: 294-310 - [c4]Paul Kaufmann, Roman Kalkreuth:
An empirical study on the parametrization of cartesian genetic programming. GECCO (Companion) 2017: 231-232 - [c3]Paul Kaufmann, Roman Kalkreuth:
Parametrizing Cartesian Genetic Programming: An Empirical Study. KI 2017: 316-322 - 2016
- [c2]Roman Kalkreuth, Günter Rudolph, Jörg Krone:
More efficient evolution of small genetic programs in Cartesian Genetic Programming by using genotypie age. CEC 2016: 5052-5059 - 2015
- [c1]Roman Kalkreuth, Günter Rudolph, Jörg Krone:
Improving Convergence in Cartesian Genetic Programming Using Adaptive Crossover, Mutation and Selection. SSCI 2015: 1415-1422
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-05-08 23:25 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:
