Sciweavers

2814 search results - page 52 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ACTA
2006
70views more  ACTA 2006»
15 years 2 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...
SPAA
2006
ACM
15 years 8 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
BIRTHDAY
2003
Springer
15 years 7 months ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....
WSCG
2004
139views more  WSCG 2004»
15 years 3 months ago
Clustering in Virtual Plant Ecosystems
The spatial plant distribution in virtual ecosystems is usually modeled by means of artificial life. Each plant is considered as a solitary element competing for its resources and...
Bedrich Benes, J. M. Soto Guerrero
PAM
2005
Springer
15 years 7 months ago
Scalable Coordination Techniques for Distributed Network Monitoring
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...
Manish R. Sharma, John W. Byers