118 search results - page 7 / 24 » On-line Algorithms |
SODA
1997
ACM
13 years 8 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...
COMPGEOM
1992
ACM
13 years 11 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
SODA
1998
ACM
13 years 8 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 ...
COMPENG
2010
13 years 2 months ago
2010
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...