Login / Signup
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
Christian Lavault
Jean-François Marckert
Vlady Ravelomanana
Published in:
CoRR (2006)
Keyphrases
</>
worst case
computational cost
benchmark datasets
learning algorithm
computationally efficient
exhaustive search
data structure
computational complexity
optimization problems
theoretical analysis
orders of magnitude
binary search trees
significant improvement
times faster
computer networks
optimality criterion