5214 search results - page 119 / 1043 » The Online Specialization Problem |
WDAG
2007
Springer
14 years 3 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...
NETGAMES
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we advocate the problem of reusing Multiplayer Online Game (MOG) in Client-Server (C/S) architecture. The problem is that MOG services cannot continue to be provide...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
ESA
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
CPAIOR
2008
Springer
13 years 11 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...