Showing cs.NEShow all
2 papers · 1 filter
cs.NE2024
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
Xiankun Yan, Aneta Neumann, Frank Neumann
Variants of the GSEMO algorithm using multi-objective formulations have been successfully analyzed and applied to optimize chance-constrained submodular functions. However, due to…
cs.NE2022
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…