Sciweavers

1528 search results - page 275 / 306
» On Signatures for Communication Graphs
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 8 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
FTTCS
2006
132views more  FTTCS 2006»
13 years 8 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 8 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
TROB
2008
118views more  TROB 2008»
13 years 8 months ago
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos