2925 search results - page 59 / 585 » Information Complexity of Online Problems |
164
click to vote
NETGAMES
2005
ACM
15 years 11 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...
168
click to vote
ESA
2006
Springer
15 years 9 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 ...
168
click to vote
SIAMSC
2010
15 years 4 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
155
click to vote
ANOR
2010
15 years 4 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
161
click to vote
CCIA
2007
Springer
16 years 6 days ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...