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-08-12 23:42] |
staff:kalkreuth [2021-09-22 13:17] Roman Kalkreuth [Insertion and Deletion Mutation Techniques] |
||
|---|---|---|---|
| Line 21: | Line 21: | ||
| * 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 ===== | + | ====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 60: | ||
| ===== Publications ===== | ===== Publications ===== | ||
| + | |||
| + | |||
| + | 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 | ||
| + | |||
| + | 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 | ||