Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision Next revision Both sides next revision | ||
|
staff:kalkreuth [2019-07-17 12:22] |
staff:kalkreuth [2021-09-29 15:45] 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: | vorname.nachname{{:staff:at.gif|}}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++) ]] | ||
| + | |||
| + | |||
| + | ====Summer term 2019==== | ||
| + | [[https://ess.cs.tu-dortmund.de/DE/Teaching/SS2019/BS/|Betriebssystene]] | ||
| - | For the source code of the insertion and deletion mutation techniques for Cartesian Genetic Programming please contact me via email. | ||
| - | ===== Teaching ===== | ||
| ====Winter term 2018/19==== | ====Winter term 2018/19==== | ||
| Line 63: | Line 73: | ||
| ===== Publications ===== | ===== Publications ===== | ||
| + | |||
| + | R. Kalkreuth: An Empirical Study on Insertion and Deletion Mutation in Cartesian Genetic Programming, Studies in Computational | ||
| + | Intelligence 922, Springer Nature Switzerland 2021 | ||
| + | |||
| + | R. Kalkreuth: A Comprehensive Study on Subgraph Crossover in Cartesian Genetic Programming, 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. | ||
| + | |||
| + | 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. | ||
| R. Kalkreuth: Two New Mutation Techniques for Cartesian | R. Kalkreuth: Two New Mutation Techniques for Cartesian | ||
| Genetic Programming, in Proceedings of the 11th International Joint Con- | Genetic Programming, in Proceedings of the 11th International Joint Con- | ||
| - | ference on Computational Intelligence (IJCCI 2019), 2019, Vienna (Austria) | + | ference on Computational Intelligence (IJCCI 2019), 2019, Vienna (Austria) - **Best Student Paper Nomination** |
| R. Kalkreuth and A. Droschinsky: On the Time Complexity | R. Kalkreuth and A. Droschinsky: On the Time Complexity | ||
| of Simple Cartesian Genetic Programming, in Proceedings of the 11th | of Simple Cartesian Genetic Programming, in Proceedings of the 11th | ||
| International Joint Conference on Computational Intelligence (IJCCI 2019), | International Joint Conference on Computational Intelligence (IJCCI 2019), | ||
| - | 2019, Vienna (Austria) | + | 2019, Vienna (Austria) - **Best Poster Nomination** |
| + | |||
| + | |||
| + | 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 | ||
| - | 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: An Emperical Study on the Parametrization of Cartesian Genetic Programming, in Proceedings of 40th Annual German Conference on AI, September 25 - 29 2017, Dortmund (Germany) |
| - | P. Kaufmann and R. Kalkreuth: An Emperical Study on the Parametrization of Cartesian Genetic Programming, in GECCO '17 Companion, Annual Genetic and Evolutionary Computation Conference, Berlin, 2017 | ||
| 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). | ||