Evolutionary Diversity Optimisation in Constructing Satisfying Assignments-Reference-Cited by-同舟云学术

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments

Published:2023-07-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Nikfarjam Adel¹^ORCID,Rothenberger Ralf²^ORCID,Neumann Frank¹^ORCID,Friedrich Tobias²^ORCID

Affiliation:

1. Optimisation and Logistics / the School of Computer and Mathematical Science, The University of Adelaide, Adelaide, SA, Australia

2. Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdom, Brandenburg, Germany

Funder

Australian Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583131.3590517

Reference38 articles.

1. Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178. Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178.

2. Maxime Allard Simón C. Smith Konstantinos I. Chatzilygeroudis and Antoine Cully. 2022. Hierarchical quality-diversity for online damage recovery. In GECCO. ACM 58--67. Maxime Allard Simón C. Smith Konstantinos I. Chatzilygeroudis and Antoine Cully. 2022. Hierarchical quality-diversity for online damage recovery. In GECCO. ACM 58--67.

3. Carlos Ansótegui , Maria Luisa Bonet, and Jordi Levy . 2009 . Towards IndustrialLike Random SAT Instances. In IJCAI. 387--392. Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. 2009. Towards IndustrialLike Random SAT Instances. In IJCAI. 387--392.

4. Evolving diverse TSP instances by means of novel and creative mutation operators

5. Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564. Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Cyber Defense in Dynamic Active Directories Through Reinforcement Learning;Lecture Notes in Computer Science;2024

2. Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem;Lecture Notes in Computer Science;2024

3. Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential;Lecture Notes in Computer Science;2024