Login / Signup
When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems.
André Thomaser
Jacob de Nobel
Diederick Vermetten
Furong Ye
Thomas Bäck
Anna V. Kononova
Published in:
GECCO (2023)
Keyphrases
</>
preprocessing
times faster
detection algorithm
optimization algorithm
continuous domains
continuous variables
benchmark problems
high accuracy
computational complexity
learning algorithm
improved algorithm
recognition algorithm
objective function
computational cost
dynamic programming
worst case
expectation maximization
theoretical analysis
similarity measure
optimal solution
optimal or near optimal
iterative algorithms
genetic algorithm
image sequences
combinatorial optimization
data streams
ant colony optimization
search space
significant improvement
computationally efficient
np hard
probabilistic model