National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Weakly Connected Topologies
Kenyeres, Martin ; Novotný, Bohumil
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on weakly connected structures.
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Strongly Connected Topologies
Kenyeres, Martin ; Novotný, Bohumil
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on strongly connected structures.
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Strongly Connected Topologies
Kenyeres, Martin ; Novotný, Bohumil
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on strongly connected structures.
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Weakly Connected Topologies
Kenyeres, Martin ; Novotný, Bohumil
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on weakly connected structures.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.