Sciweavers

948 search results - page 151 / 190
» What can we achieve by arbitrary announcements
Sort
View
PE
2002
Springer
150views Optimization» more  PE 2002»
13 years 8 months ago
Delimiting the range of effectiveness of scalable on-demand streaming
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
Haonan Tan, Derek L. Eager, Mary K. Vernon
TSP
2010
13 years 3 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao
SIGCOMM
2012
ACM
11 years 11 months ago
Picasso: flexible RF and spectrum slicing
This paper presents the design, implementation and evaluation of Picasso, a novel radio design that allows simultaneous transmission and reception on separate and arbitrary spectr...
Steven Siying Hong, Jeffrey Mehlman, Sachin Rajsek...
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
13 years 15 days ago
Power management of online data-intensive services
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
David Meisner, Christopher M. Sadler, Luiz Andr&ea...
DSN
2005
IEEE
14 years 2 months ago
How Resilient are Distributed f Fault/Intrusion-Tolerant Systems?
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...