Home > Search Results: keywords:"Push-Sum algorithm"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 5 records found  Search took 0.01 seconds. 
Application of distributed and stochastic algorithms in network.
 Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
Detailed record
Application of distributed and stochastic algorithms in network.
 Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Škorpil, Vladislav (advisor)
This thesis deals with the distributed and stochastic algorithms, including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Futhermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in MATLAB.
Detailed record
Application of distributed and stochastic algorithms in network.
 Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Škorpil, Vladislav (advisor)
This thesis deals with the distributed and stochastic algorithms, including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Futhermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in MATLAB.
Detailed record
Application of distributed and stochastic algorithms in network.
 Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
Detailed record
Application of distributed and stochastic algorithms in network.
 Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English