613 search results - page 117 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
118
click to vote
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
111
click to vote
PODC
1997
ACM
15 years 3 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
158
Voted
RECOMB
2002
Springer
15 years 12 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
105
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
92
Voted
ADHOCNOW
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...