Sciweavers

570 search results - page 104 / 114
» Edge Coloring with Delays
Sort
View
111
Voted
SIROCCO
2010
15 years 1 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
ATMN
1996
15 years 1 months ago
Dynamic time sharing: a new approach for congestion management
A new approach for bandwidth allocation and congestion control is reported in this paper, which is of the Rate Controlled admission with Priority Scheduling service type. It is ca...
Adrian Popescu, Parag Pruthi
ADHOCNOW
2008
Springer
15 years 27 days ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
AHSWN
2010
105views more  AHSWN 2010»
14 years 12 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
COMCOM
2010
133views more  COMCOM 2010»
14 years 12 months ago
Supporting mobility in an IMS-based P2P IPTV service: A proactive context transfer mechanism
In recent years, IPTV has received an increasing amount of interest from the industry, commercial providers and the research community, alike. In this context, standardization bod...
Iván Vidal, Jaime García-Reinoso, An...