Fast Perturbative Algorithm Configurators.
George T. HallPietro S. OlivetoDirk SudholtPublished in: PPSN (1) (2020)
Keyphrases
- theoretical analysis
- preprocessing
- dynamic programming
- k means
- times faster
- search space
- learning algorithm
- computational complexity
- detection algorithm
- experimental evaluation
- single pass
- experimental study
- recognition algorithm
- worst case
- computational cost
- improved algorithm
- significant improvement
- high accuracy
- convergence rate
- cost function
- optimization algorithm
- optimal solution
- selection algorithm
- particle swarm optimization
- constraint satisfaction
- ant colony optimization
- clustering method
- computationally efficient
- expectation maximization
- input data
- hidden markov models
- similarity measure