Sciweavers

25 search results - page 1 / 5
» A new approach to counting broadcast trees
Sort
View
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
13 years 8 months ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman
WDAG
1998
Springer
123views Algorithms» more  WDAG 1998»
13 years 9 months ago
Propagation and Leader Election in a Multihop Broadcast Environment
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
Israel Cidon, Osnat Mokryn
POPL
2004
ACM
14 years 5 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ADHOCNOW
2009
Springer
13 years 2 months ago
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
Christopher Miller, Christian Poellabauer