Search for dissertations about: "Consensus Algorithms"

Showing result 1 - 5 of 25 swedish dissertations containing the words Consensus Algorithms.

  1. 1. Constructing Evolutionary Trees - Algorithms and Complexity

    University dissertation from Department of Computer Science, Lund University

    Author : Anna Östlin; Lund University.; Lunds universitet.; [2001]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    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. 2. Consensus Trade-offs in Wireless Sensor Networks

    University dissertation from Department of Computer Science, Lund University

    Author : CHRISTOPHER LINDBERG; [2015]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Distributed Algorithms; Wireless Sensor Networks; Compressed Sensing; Consensus Algorithms; Trade-off Analysis;

    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. 3. On the Design and Analysis of Consensus Protocols for Automotive Electronic Systems

    University dissertation from Department of Computer Science, Lund University

    Author : Negin Fathollah Nejad Asl; [2014]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Communication Failures; Consensus; Distributed Algorithms; Automotive Systems; Probabilistic Analysis;

    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. 4. On the Design and Analysis of Consensus Protocols for Vehicular Ad Hoc Networks

    University dissertation from ; Chalmers tekniska högskola; Gothenburg

    Author : Negin Fathollah Nejad Asl; [2017]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Vehicular Ad-Hoc Networks; Intelligent Transportation Systems; Probabilistic Analysis; Communication Failure; Agreement Algorithms; Consensus;

    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. 5. Consensus Algorithms for Trees and Strings

    University dissertation from Computer Science, Lund University

    Author : Jesper Jansson; Lund University.; Lunds universitet.; [2003]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; computational complexity; Approximation algorithm; labeled tree; lowest common ancestor constraint; maximum agreement subtree; alignment between trees; clustering; Computer science; Hamming metric; systems; control; Datalogi; numerisk analys; system; kontroll;

    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