5 citations · 9 across the 4 of their papers we have counts for
4 papers · 1 filter
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann +2
Chance-constrained problems involve stochastic components in the constraints which can be violated with a small probability. We investigate the impact of different types of chance…
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms
François Clément, Diederick Vermetten, Jacob de Nobel +3
The star discrepancy is a measure for the regularity of a finite set of points taken from . Low discrepancy point sets are highly relevant for Quasi-Monte Car…
Per-run Algorithm Selection with Warm-starting using Trajectory-based Features
Ana Kostovska, Anja Jankovic, Diederick Vermetten +4
Per-instance algorithm selection seeks to recommend, for a given problem instance and a given performance criterion, one or several suitable algorithms that are expected to perform…
Trajectory-based Algorithm Selection with Warm-starting
Anja Jankovic, Diederick Vermetten, Ana Kostovska +3
Landscape-aware algorithm selection approaches have so far mostly been relying on landscape feature extraction as a preprocessing step, independent of the execution of optimization…