1382 search results - page 48 / 277 » Formal Analysis of Online Algorithms |
174
click to vote
INFOCOM
2007
IEEE
16 years 3 days ago
2007
IEEE
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
208
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
138
click to vote
FM
2008
Springer
15 years 7 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
157
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
143
click to vote
WADS
2007
Springer
15 years 12 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...