Dynamic algorithm selection for runtime concepts.
Peter PirkelbauerSean ParentMat MarcusBjarne StroustrupPublished in: Sci. Comput. Program. (2010)
Keyphrases
- experimental evaluation
- learning algorithm
- dynamic programming
- computational complexity
- preprocessing
- path planning
- theoretical analysis
- high accuracy
- worst case
- single pass
- improved algorithm
- times faster
- tree structure
- objective function
- probabilistic model
- cost function
- concept lattice
- simulated annealing
- linear programming
- input data
- dynamic environments
- k means
- optimization algorithm
- optimal solution
- multiscale
- np hard
- search space
- evolutionary algorithm
- detection algorithm
- expectation maximization
- significant improvement
- computational cost