When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems.
André ThomaserJacob de NobelDiederick VermettenFurong YeThomas BäckAnna V. KononovaPublished 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