Sciweavers

644 search results - page 45 / 129
» A topological characterization of weakness
Sort
View
INFOCOM
2008
IEEE
16 years 19 days ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 6 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
IPPS
2006
IEEE
16 years 8 days ago
Free network measurement for adaptive virtualized distributed computing
An execution environment consisting of virtual machines (VMs) interconnected with a virtual overlay network can use the naturally occurring traffic of an existing, unmodified ap...
Ashish Gupta, Marcia Zangrilli, Ananth I. Sundarar...
GLOBECOM
2008
IEEE
16 years 21 days ago
WONDER: A PON over a Folded Bus
— Passive Optical Networks (PONs) represent a step forward in “first mile” networks; indeed, by using optical technologies, PONs can transfer a large amount of data, and by ...
Andrea Bianco, Davide Cuda, Jorge M. Finochietto, ...
WABI
2010
Springer
141views Bioinformatics» more  WABI 2010»
15 years 4 months ago
An Experimental Study of Quartets MaxCut and Other Supertree Methods
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
M. Shel Swenson, Rahul Suri, C. Randal Linder, Tan...