Sciweavers

557 search results - page 71 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
DAIS
2009
15 years 3 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
TON
2010
126views more  TON 2010»
14 years 8 months ago
Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
IPPS
1998
IEEE
15 years 6 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
INFOCOM
2007
IEEE
15 years 8 months ago
Optimal Pricing in a Free Market Wireless Network
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Michael J. Neely
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 6 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum