Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge.
Ajoy K. DattaStéphane DevismesLawrence L. LarmoreVincent VillainPublished in: Parallel Process. Lett. (2017)
Keyphrases
- edge detection
- memory usage
- cache conscious
- decision trees
- edge information
- binary trees
- computing power
- peer to peer
- edge detector
- memory requirements
- machine learning
- memory size
- memory space
- tree structures
- payment scheme
- leader follower
- limited memory
- multiple scales
- multi agent
- lower bound
- weighted graph
- tree structure