613 search results - page 100 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
122
click to vote
EWSN
2006
Springer
15 years 11 months ago
2006
Springer
Energy-aware algorithms have proven to be a crucial part of sensor network applications, especially if they are required to operate for extended periods of time. Among these, effic...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
113
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
102
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...