1068 search results - page 1 / 214 » On Space Bounded Server Algorithms |
ICCI
1993
13 years 10 months ago
1993
STOC
2012
ACM
11 years 8 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
STOC
1991
ACM
13 years 9 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
WAOA
2007
Springer
13 years 12 months ago
2007
Springer
CN
2002
13 years 5 months ago
2002
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large ...