Items where Funder is European Cooperation in Science and Technology.
Up a levelCA15140
Oliveto, P.S., Sudholt, D. and Witt, C. (2022) Tight bounds on the expected runtime of a standard steady state genetic algorithm. Algorithmica, 84 (6). pp. 1603-1658. ISSN 0178-4617
Dang, D., Friedrich, T., Kötzing, T. et al. (5 more authors) (2016) Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. In: Parallel Problem Solving from Nature – PPSN XIV. Parallel Problem Solving from Nature (PPSN 2016), 17-21 Sep 2016, Edinburgh, UK. Lecture Notes in Computer Science, 9921 . Springer International Publishing .
Dang, D.C., Friedrich, T., Kötzing, T. et al. (5 more authors) (2018) Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation, 22 (3). pp. 484-497. ISSN 1089-778X
Oliveto, P.S., Paixão, T., Pérez Heredia, J. et al. (2 more authors) (2018) How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica, 80 (5). pp. 1604-1633. ISSN 0178-4617
Corus, D., He, J., Jansen, T. et al. (3 more authors) (2017) On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica, 78 (2). pp. 714-740. ISSN 0178-4617
Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2019) On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica, 81 (4). pp. 1450-1489. ISSN 0178-4617
Lissovoi, A., Sudholt, D. orcid.org/0000-0001-6020-1646, Wagner, M. et al. (1 more author) (2017) Theoretical results on bet-and-run as an initialisation strategy. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017). Genetic and Evolutionary Computation Conference (GECCO 2017), 15/07/2017 - 19/07/2017, Berlin. ACM , pp. 857-864.
Hall, G.T., Oliveto, P.S. and Sudholt, D. (2022) On the impact of the performance metric on efficient algorithm configuration. Artificial Intelligence, 303. 103629. ISSN 0004-3702
Lengler, J., Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2018) Medium step sizes are harmful for the compact genetic algorithm. In: Aquirre, H., (ed.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018). Genetic and Evolutionary Computation Conference (GECCO 2018), 15-19 Jul 2018, Kyoto, Japan. ACM , pp. 1499-1506. ISBN 978-1-4503-5618-3
EP/M004252/1
Oliveto, P.S., Sudholt, D. and Witt, C. (2022) Tight bounds on the expected runtime of a standard steady state genetic algorithm. Algorithmica, 84 (6). pp. 1603-1658. ISSN 0178-4617
Dang, D., Friedrich, T., Kötzing, T. et al. (5 more authors) (2016) Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. In: Parallel Problem Solving from Nature – PPSN XIV. Parallel Problem Solving from Nature (PPSN 2016), 17-21 Sep 2016, Edinburgh, UK. Lecture Notes in Computer Science, 9921 . Springer International Publishing .
Dang, D.C., Friedrich, T., Kötzing, T. et al. (5 more authors) (2018) Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation, 22 (3). pp. 484-497. ISSN 1089-778X
Oliveto, P.S., Paixão, T., Pérez Heredia, J. et al. (2 more authors) (2018) How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica, 80 (5). pp. 1604-1633. ISSN 0178-4617
Corus, D., He, J., Jansen, T. et al. (3 more authors) (2017) On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica, 78 (2). pp. 714-740. ISSN 0178-4617
Hall, G.T., Oliveto, P.S. and Sudholt, D. (2022) On the impact of the performance metric on efficient algorithm configuration. Artificial Intelligence, 303. 103629. ISSN 0004-3702
EU COST ACTION CA18123
Boskovic, B., Churchill, H. and Hamzallari, O. (2021) Family policy and child well-being: The case of Montenegro in the European perspective. International Journal of Environmental Research and Public Health, 18 (17). 9118. ISSN 1660-4601
SAGE - 138086
Dang, D., Friedrich, T., Kötzing, T. et al. (5 more authors) (2016) Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. In: Parallel Problem Solving from Nature – PPSN XIV. Parallel Problem Solving from Nature (PPSN 2016), 17-21 Sep 2016, Edinburgh, UK. Lecture Notes in Computer Science, 9921 . Springer International Publishing .
Dang, D.C., Friedrich, T., Kötzing, T. et al. (5 more authors) (2018) Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation, 22 (3). pp. 484-497. ISSN 1089-778X
Oliveto, P.S., Paixão, T., Pérez Heredia, J. et al. (2 more authors) (2018) How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica, 80 (5). pp. 1604-1633. ISSN 0178-4617
Corus, D., He, J., Jansen, T. et al. (3 more authors) (2017) On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica, 78 (2). pp. 714-740. ISSN 0178-4617
Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2019) On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica, 81 (4). pp. 1450-1489. ISSN 0178-4617
Lissovoi, A., Sudholt, D. orcid.org/0000-0001-6020-1646, Wagner, M. et al. (1 more author) (2017) Theoretical results on bet-and-run as an initialisation strategy. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017). Genetic and Evolutionary Computation Conference (GECCO 2017), 15/07/2017 - 19/07/2017, Berlin. ACM , pp. 857-864.