Sciweavers

2814 search results - page 361 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 5 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
DSN
2005
IEEE
14 years 4 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
HPDC
2010
IEEE
13 years 11 months ago
A data transfer framework for large-scale science experiments
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...
Wantao Liu, Brian Tieman, Rajkumar Kettimuthu, Ian...
TVCG
2010
186views more  TVCG 2010»
13 years 9 months ago
An Information-Theoretic Framework for Flow Visualization
—The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algori...
Lijie Xu, Teng-Yok Lee, Han-Wei Shen
PODC
2009
ACM
14 years 11 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...