Sciweavers

206 search results - page 7 / 42
» Better Bounds for Online Scheduling
Sort
View
JSAC
2007
128views more  JSAC 2007»
13 years 7 months ago
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
— Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang
JCO
2006
83views more  JCO 2006»
13 years 7 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 27 days ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Adaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
H. Brendan McMahan, Matthew J. Streeter
RTSS
2002
IEEE
14 years 13 days ago
Dynamic Scan Scheduling
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
Bruno Dutertre