1503 search results - page 6 / 301 » Self-optimizing distributed trees |
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
COLT
2003
Springer
15 years 4 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
ICPADS
2005
IEEE
15 years 5 months ago
2005
IEEE
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...
98
Voted
COMPSAC
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...