2566 search results - page 86 / 514 » The Online Median Problem |
WDAG
2007
Springer
15 years 6 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...
101
click to vote
NETGAMES
2005
ACM
15 years 6 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...
114
click to vote
ESA
2006
Springer
15 years 4 months 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 ...
123
Voted
CPAIOR
2008
Springer
15 years 2 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...
116
click to vote
AAAI
1998
15 years 2 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...