Sciweavers

168 search results - page 25 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
MST
2006
100views more  MST 2006»
14 years 9 months ago
On Delivery Times in Packet Networks under Adversarial Traffic
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
Adi Rosén, Michael S. Tsirkin
JCT
2006
88views more  JCT 2006»
14 years 9 months ago
Multiplicative structures in additively large sets
Abstract. Previous research extending over a few decades has established that multiplicatively large sets (in any of several interpretations) must have substantial additive structu...
Mathias Beiglböck, Vitaly Bergelson, Neil Hin...
COLT
2010
Springer
14 years 7 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
COLT
2004
Springer
15 years 1 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
ICNP
1998
IEEE
15 years 1 months ago
Flow Theory: An Enhancement
Flow Theory is a rich, effective theory introduced in order to study real-time network protocols. It is based on discrete mathematics in which a flow of data is represented by an ...
Alfio Lombardo, Giacomo Morabito, Sergio Palazzo, ...