61 citations · 570 across the 108 of their papers we have counts for
13 papers · 1 filter
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Max Ward, Aneta Neumann +2
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
Feng Shi, Daoyu Huang, Xiankun Yan +1
The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing…
Theoretical Study of Optimizing Rugged Landscapes with the cGA
Tobias Friedrich, Timo Kötzing, Frank Neumann +1
Estimation of distribution algorithms (EDAs) provide a distribution - based approach for optimization which adapts its probability distribution during the run of the algorithm. We…
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions
Frank Neumann, Carsten Witt
Linear functions play a key role in the runtime analysis of evolutionary algorithms and studies have provided a wide range of new insights and techniques for analyzing evolutionary…
Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation
Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann +1
Diversification in a set of solutions has become a hot research topic in the evolutionary computation community. It has been proven beneficial for optimisation problems in several…
Analysis of Quality Diversity Algorithms for the Knapsack Problem
Adel Nikfarjam, Anh Viet Do, Frank Neumann
Quality diversity (QD) algorithms have been shown to be very successful when dealing with problems in areas such as robotics, games and combinatorial optimization. They aim to maxi…