Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:kalkreuth [2019-07-17 12:19] |
staff:kalkreuth [2019-08-12 23:42] |
||
|---|---|---|---|
| Line 25: | Line 25: | ||
| For the source code of the Subgraph Crossover for Cartesian Genetic Programming please | For the source code of the Subgraph Crossover for Cartesian Genetic Programming please | ||
| contact me via email. | contact me via email. | ||
| + | |||
| + | |||
| + | ===== Insertion and Deletion Mutation Techniques ===== | ||
| + | |||
| + | For the source code of the insertion and deletion mutation techniques for Cartesian Genetic Programming please contact me via email. | ||
| ===== Teaching ===== | ===== Teaching ===== | ||
| + | |||
| + | ====Winter term 2018/19==== | ||
| + | |||
| + | [[https://ls11-www.cs.tu-dortmund.de/people/rudolph/teaching/lectures/EINI/WS2018-19/lecture.jsp|Introduction to Programming (C++)]]] | ||
| + | |||
| ====Summer term 2018==== | ====Summer term 2018==== | ||
| [[https://ls11-www.cs.tu-dortmund.de/people/rudolph/teaching/lectures/MAFIN2/SS2018/lecture.jsp|Mathematics for Computer Scientists II]] | [[https://ls11-www.cs.tu-dortmund.de/people/rudolph/teaching/lectures/MAFIN2/SS2018/lecture.jsp|Mathematics for Computer Scientists II]] | ||
| Line 56: | Line 66: | ||
| 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). | ||