Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
staff:kalkreuth [2020-07-27 20:52] Roman Kalkreuth [Publications] |
staff:kalkreuth [2022-06-25 14:49] (current) Roman Kalkreuth [Roman Kalkreuth] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| | Phone: | +49 231 755-7714 | | | Phone: | +49 231 755-7714 | | ||
| | Fax: | +49 231 755 7740 | | | Fax: | +49 231 755 7740 | | ||
| - | | E-Mail: | roman.kalkreuth{{:staff:at.gif|}}tu-dortmund.de {{:staff:roman_kalkreuth_public_key.txt|PGP-Key}} | | + | | E-Mail: | roman.kalkreuth(at)tu-dortmund.de | |
| + | Curriculum Vitae: {{ :staff:kalkreuth:cv-roman-kalkreuth.pdf |cv_roman_kalkreuth.pdf}} | ||
| + | ORCiD: [[https://orcid.org/0000-0003-1449-5131 | 0000-0003-1449-5131]] | ||
| + | {{:staff:kalkreuth:orcid.png?80|}} | ||
| ===== Consultation hours ==== | ===== Consultation hours ==== | ||
| Line 21: | Line 23: | ||
| * Evolutionary Computation for Image Processing and Analysis | * Evolutionary Computation for Image Processing and Analysis | ||
| - | ===== Subgraph Crossover ===== | ||
| - | For the source code of the Subgraph Crossover for Cartesian Genetic Programming please | ||
| - | contact me via email. | ||
| + | ===== Teaching ===== | ||
| - | ===== Insertion and Deletion Mutation Techniques ===== | + | ====Winter term 2020/21==== |
| + | [[https://ls11-www.cs.tu-dortmund.de/teaching/ep2021vorlesung|Introduction to Programming (C++) ]] | ||
| + | |||
| + | |||
| + | ====Summer term 2020==== | ||
| + | [[https://ess.cs.tu-dortmund.de/Teaching/SS2020/BS/|Betriebssysteme ]] | ||
| + | |||
| + | ====Winter term 2019/20==== | ||
| + | [[https://ls11-www.cs.tu-dortmund.de/teaching/ep1920vorlesung|Introduction to Programming (C++) ]] | ||
| - | For the source code of the insertion and deletion mutation techniques for Cartesian Genetic Programming please contact me via email. | ||
| - | ===== Teaching ===== | ||
| ====Summer term 2019==== | ====Summer term 2019==== | ||
| Line 68: | Line 74: | ||
| ===== Publications ===== | ===== Publications ===== | ||
| + | L. Sotto, P. Kaufmann, T. Atkinson, R. Kalkreuth, M. Porto Basgalupp: Graph representations in genetic programming”, Genetic Programming and Evolvable Machines, Springer, 2021 | ||
| + | |||
| + | R. Kalkreuth: An Empirical Study on Insertion and Deletion Mutation in Cartesian Genetic Programming, In Studies in Computational | ||
| + | Intelligence 922, Springer Nature Switzerland 2021 | ||
| - | R. Kalkreuth: A Comprehensive Study on Subgraph Crossover in Cartesian Genetic Programming, Accepted as full paper for publication in the conference proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020), 2020 | + | R. Kalkreuth: A Comprehensive Study on Subgraph Crossover in Cartesian Genetic Programming, In Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020), 2020 |
| - | L. Sotto, P. Kaufmann, T. Atkinson, R. Kalkreuth, and M. Basgalupp. A Study on Graph Representations for Genetic Programming. In Genetic and Evolutionary Computation (GECCO). Accepted as full paper for publication in GECCO conference proceedings. ACM, 2020. | + | L. Sotto, P. Kaufmann, T. Atkinson, R. Kalkreuth, and M. Basgalupp. A Study on Graph Representations for Genetic Programming. In GECCO '20, Annual Genetic and Evolutionary Computation Conference, ACM, 2020. |
| - | P. Kaufmann and R. Kalkreuth. On the Parameterization of Cartesian Genetic Programming. In IEEE Congress on Evolutionary Computation (CEC). Accepted as full paper for publication in the conference proceedings. IEEE, 2020. | + | P. Kaufmann and R. Kalkreuth. On the Parameterization of Cartesian Genetic Programming. In IEEE Congress on Evolutionary Computation (CEC). . Proceedings of 2020 IEEE Congress on Evolutionary Computation (CEC 2020),IEEE, 2020. |
| R. Kalkreuth: Two New Mutation Techniques for Cartesian | R. Kalkreuth: Two New Mutation Techniques for Cartesian | ||
| Line 85: | Line 95: | ||
| - | J. Husa and R. Kalkreuth: A Comparative Study on Crossover in Cartesian Genetic Programming, in Proceedings of the 21th European Conference on Genetic Programming (EuroGP 2018), 4 - 6 April 2018, Parma (Italy). | + | J. Husa and R. Kalkreuth: A Comparative Study on Crossover in Cartesian Genetic Programming, in Proceedings of the 21th European Conference on Genetic Programming (EuroGP 2018), 4 - 6 April 2018, Parma (Italy) |
| - | P. Kaufmann and R. Kalkreuth: Parametrizing Cartesian Genetic Programming: An Empirical Study , in GECCO '17 Companion, Annual Genetic and Evolutionary Computation Conference, Berlin, 2017 | + | P. Kaufmann and R. Kalkreuth: Parametrizing Cartesian Genetic Programming: An Empirical Study , in GECCO '17 Companion, Annual Genetic and Evolutionary Computation Conference, Berlin (Germany), 2017 |
| Line 95: | Line 105: | ||
| R. Kalkreuth, G. Rudolph, and A. Droschinsky: A New Subgraph Crossover for Cartesian Genetic Programming , accepted for publication in Proceedings of the 20th European Conference on Genetic Programming (EuroGP 2017), 19 - 21 April 2017, Amsterdam (The Netherlands). | R. Kalkreuth, G. Rudolph, and A. Droschinsky: A New Subgraph Crossover for Cartesian Genetic Programming , accepted for publication in Proceedings of the 20th European Conference on Genetic Programming (EuroGP 2017), 19 - 21 April 2017, Amsterdam (The Netherlands). | ||
| - | R. Kalkreuth, G. Rudolph, and J. Krone: More Efficient Evolution of Small Genetic Programs in Cartesian Genetic Programming by Using Genotypic Age, Proceedings of 2016 IEEE Congress on Evolutionary Computation (CEC 2016), 25 - 29 July 2016, Vancouver (Canada). | + | R. Kalkreuth, G. Rudolph, and J. Krone: More Efficient Evolution of Small Genetic Programs in Cartesian Genetic Programming by Using Genotypic Age, Proceedings of 2016 IEEE Congress on Evolutionary Computation (CEC 2016), 25 - 29 July 2016, Vancouver (Canada) |
| R. Kalkreuth, G. Rudolph and J. Krone: Improving Convergence in Cartesian Genetic Programming Using Adaptive | R. Kalkreuth, G. Rudolph and J. Krone: Improving Convergence in Cartesian Genetic Programming Using Adaptive | ||