79 search results - page 3 / 16 » Randomized Competitive Algorithms for Generalized Caching |
ECRTS
2006
IEEE
13 years 11 months ago
2006
IEEE
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...