OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Gerth Stølting BrodalGabriel MoruzAndrei NegoescuPublished in: Theory Comput. Syst. (2015)
Keyphrases
- experimental evaluation
- preprocessing
- detection algorithm
- computational complexity
- learning algorithm
- dynamic programming
- worst case
- optimization algorithm
- segmentation algorithm
- single pass
- selection algorithm
- times faster
- monte carlo
- theoretical analysis
- computationally efficient
- computational cost
- optimal solution
- ant colony optimization
- tree structure
- path planning
- memory requirements
- cost function