Search for dissertations about: "Consensus Algorithms"
Showing result 1 - 5 of 36 swedish dissertations containing the words Consensus Algorithms.
-
1. Constructing Evolutionary Trees - Algorithms and Complexity
Abstract : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. READ MORE
-
2. Consensus Trade-offs in Wireless Sensor Networks
Abstract : As more and more everyday electronic devices become equipped with the combined re- sources of computation, sensing, and wireless communications, possible platforms for implementation of wireless sensor networks have become ubiquitous. The combination of these three main capabilities of such a network present the opportunity to for example gather high resolution measurement data, or cooperatively perform advanced computa- tional tasks. READ MORE
-
3. On the Design and Analysis of Consensus Protocols for Automotive Electronic Systems
Abstract : This thesis deals with the fundamental problem of reaching agreement on a value in a distributedcomputing system in the presence of faults. We address this problem in the contextof safety-critical distributed automotive applications, such as virtual traffic lights. READ MORE
-
4. On the Design and Analysis of Consensus Protocols for Vehicular Ad Hoc Networks
Abstract : Vehicle-to-vehicle communication technologies support diverse cooperative applications for intelligent transportation systems to increase safety and fuel efficiency of road vehicles. Vehicles participating in a cooperative pplication are expected to make coordinated and mutually consistent decisions. READ MORE
-
5. Consensus Algorithms for Trees and Strings
Abstract : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. READ MORE