Differences
This shows you the differences between two versions of the page.
|
staff:droschinsky [2018-06-19 18:37] |
staff:droschinsky [2018-06-28 15:57] |
||
|---|---|---|---|
| Line 56: | Line 56: | ||
| ==== Refereed Conference Proceedings ==== | ==== Refereed Conference Proceedings ==== | ||
| - | * **[[https://arxiv.org/abs/1805.00821|Largest Weight Common Subtree Embeddings with Distance Penalties (arxiv)]]** \\ //Andre Droschinsky, Nils Kriege, Petra Mutzel// \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, 54:1-54:13, to appear. | + | * **[[https://arxiv.org/abs/1805.00821|Largest Weight Common Subtree Embeddings with Distance Penalties (arxiv)]]** \\ //Andre Droschinsky, Nils Kriege, Petra Mutzel// \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, 54:1-54:15, to appear. |
| * **[[https://link.springer.com/chapter/10.1007/978-3-319-55696-3_19|A New Subgraph Crossover for Cartesian Genetic Programming]]** \\ //Roman Kalkreuth, Günter Rudolph, Andre Droschinsky// \\ 20th European Conference on Genetic Programming (EuroGP) 2017 | * **[[https://link.springer.com/chapter/10.1007/978-3-319-55696-3_19|A New Subgraph Crossover for Cartesian Genetic Programming]]** \\ //Roman Kalkreuth, Günter Rudolph, Andre Droschinsky// \\ 20th European Conference on Genetic Programming (EuroGP) 2017 | ||