On Algorithm Selection, with an application to combinatorial search problems.
Lars KotthoffPublished in: Constraints An Int. J. (2015)
Keyphrases
- selection algorithm
- computational complexity
- experimental evaluation
- learning algorithm
- detection algorithm
- theoretical analysis
- optimal solution
- high accuracy
- k means
- computational cost
- np hard
- cost function
- significant improvement
- linear programming
- similarity measure
- times faster
- matching algorithm
- objective function
- worst case
- dynamic programming
- motion estimation
- denoising
- probabilistic model
- data streams
- special case
- computationally efficient
- data sets
- reinforcement learning
- clustering method
- experimental study
- preprocessing
- memory requirements
- search space
- improved algorithm
- single pass