38 search results - page 1 / 8 » Randomized Competitive Analysis for Two-Server Problems |
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
SIAMCOMP
2012
11 years 7 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
EUROPAR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...