79 search results - page 11 / 16 » Randomized Competitive Algorithms for Generalized Caching |
ESA
2005
Springer
14 years 29 days ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
SPAA
2010
ACM
14 years 8 days ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
EUROPAR
1997
Springer
13 years 11 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
JDA
2006
13 years 7 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...