When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems - Data and Code
Zenodo (CERN European Organization for Nuclear Research)
Abstract
Reproducibility files and additional figures for the paper When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems https://doi.org/10.1145/3583131.3590410
Authors 6
-
André Thomaser Aachen
Affiliation as printed
LIACS, Leiden University
-
Jacob de Nobel Aachen
Affiliation as printed
LIACS, Leiden University
-
Diederick Vermetten Aachen
Affiliation as printed
LIACS, Leiden University
-
Furong Ye Aachen
Affiliation as printed
LIACS, Leiden University
-
Thomas Bäck Aachen
Affiliation as printed
LIACS, Leiden University
-
Anna V. Kononova Aachen
Affiliation as printed
LIACS, Leiden University
Cited by 1 stored of 1
1 result
No patents citing this paper on Lens.org (checked 2026-10-11).