We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
Finding the median distributively
โ Scribed by Michael Rodeh
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 309 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Median based smoothing algorithms have received considerable attention in the last few years. Their properties make them sometimes superior to linear smoothers. In this paper we develop an expression for the bivariate distribution of a mediansmoothed Markov chain and we illustrate one application of
We want to find the location of p facilities which minimize the expected total cost, when the cost for using a facility is a stochastic variable with unknown probability distribution. Using the method of the asymptotic approximations the expected optimal value of the allocation variables is shown to