Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision Next revision Both sides next revision | ||
|
staff:kalkreuth [2020-07-01 15:40] Roman Kalkreuth [Teaching] |
staff:kalkreuth [2020-11-16 13:26] Roman Kalkreuth |
||
|---|---|---|---|
| Line 30: | Line 30: | ||
| For the source code of the insertion and deletion mutation techniques for Cartesian Genetic Programming please contact me via email. | For the source code of the insertion and deletion mutation techniques for Cartesian Genetic Programming please contact me via email. | ||
| + | |||
| ===== Teaching ===== | ===== Teaching ===== | ||
| Line 67: | Line 68: | ||
| ===== 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. | 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. | ||