OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Gerth Stølting BrodalGabriel MoruzAndrei NegoescuPublished in: WAOA (2011)
Keyphrases
- experimental evaluation
- learning algorithm
- computational cost
- cost function
- monte carlo
- optimization algorithm
- dynamic programming
- improved algorithm
- recognition algorithm
- np hard
- times faster
- matching algorithm
- detection algorithm
- search space
- computationally efficient
- linear programming
- significant improvement
- ant colony optimization
- randomized algorithms
- single pass
- data sets
- input data
- worst case
- evolutionary algorithm
- preprocessing
- optimal solution
- objective function
- face recognition
- decision trees
- image processing
- data mining
- neural network