106 search results - page 2 / 22 » A randomized on-line algorithm for the k-server problem on a... |
SODA
1997
ACM
13 years 6 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
MST
2002
13 years 5 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
ALT
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
STOC
1991
ACM
13 years 8 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...