National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.

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