Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Strongly Connected Topologies

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F16%3APU118462" target="_blank" >RIV/00216305:26220/16:PU118462 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Strongly Connected Topologies

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/LO1401" target="_blank" >LO1401: Interdisciplinary Research of Wireless Technologies</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

STUDENT EEICT

ISBN

978-80-214-5350-0

ISSN

—

e-ISSN

—

Number of pages

5

Pages from-to

569-574

Publisher name

Neuveden

Place of publication

Neuveden

Event location

Brno

Event date

Apr 28, 2016

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—