6105 search results - page 432 / 1221 » A Parallel Algorithm for Bound-Smoothing |
190
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
202
click to vote
IPPS
2006
IEEE
16 years 27 days ago
2006
IEEE
As mobile ad hoc networks provide a wide range of possibly critical services, providing quality of service guarantees becomes an essential element. Yet there is a limited understa...
171
click to vote
ISPAN
2005
IEEE
16 years 14 days ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
172
click to vote
PDP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a ...
238
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...