Sciweavers

1823 search results - page 25 / 365
» Distributed lossy averaging
Sort
View
94
Voted
MST
2002
152views more  MST 2002»
15 years 4 days ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
85
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
116
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 10 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
CDC
2010
IEEE
173views Control Systems» more  CDC 2010»
14 years 7 months ago
Corrective consensus: Converging to the exact average
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
Yin Chen, Roberto Tron, Andreas Terzis, René...
COLT
2007
Springer
15 years 6 months ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...