On the impact of the cutoff time on the performance of algorithm configurators.
George T. HallPietro S. OlivetoDirk SudholtPublished in: GECCO (2019)
Keyphrases
- dynamic programming
- detection algorithm
- high accuracy
- computational cost
- optimal solution
- computational complexity
- preprocessing
- times faster
- objective function
- experimental evaluation
- k means
- np hard
- single pass
- computationally efficient
- simulated annealing
- learning algorithm
- cost function
- space complexity
- hardware implementation
- selection algorithm
- particle swarm optimization
- multiscale
- worst case
- reinforcement learning
- artificial neural networks
- similarity measure
- linear programming
- image processing
- feature selection
- probabilistic model
- improved algorithm
- estimation algorithm
- hidden markov models
- neural network