Search for dissertations about: "Message Passing"

Showing result 1 - 5 of 34 swedish dissertations containing the words Message Passing.

  1. 1. Nonparametric Message Passing Methods for Cooperative Localization and Tracking

    University dissertation from Madrid, Spain : Archivo Digital, UPM

    Author : Vladimir Savic; [2012]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; cooperative localization; tracking; wireless sensor networks; message passing; particle filtering; belief propagation; RFID;

    Abstract : The objective of this thesis is the development of cooperative localization and tracking algorithms using nonparametric message passing techniques. In contrast to the most well-known techniques, the goal is to estimate the posterior probability density function (PDF) of the position of each sensor. READ MORE

  2. 2. Efficient memory management for message-passing concurrency, Part I Single-threaded execution

    University dissertation from Uppsala University

    Author : Jesper Wilhelmsson; Uppsala universitet.; Uppsala universitet.; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Abstract : Manual memory management is error prone. Some of the errors it causes, in particular memory leaks and dangling pointers, are hard to find. Manual memory management becomes even harder when concurrency enters the picture. READ MORE

  3. 3. Topics in Distributed Algorithms: On TDMA for Ad Hoc Networks and Coded Atomic Storage Algorithms

    University dissertation from Uppsala University

    Author : Thomas Petig; [2015]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Fault-Tolerance; TDMA; Message Passing; Self-Stabilization; Distributed Algorithm; Wireless Networks; Time Division Multiple Access; Shared Memory; Privacy;

    Abstract : Distributed algorithms run on a network of nodes. The nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. In this context, the challenges are to show thatthe algorithm is correct, regardless of computational, or communication delays. READ MORE

  4. 4. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming

    University dissertation from ; Chalmers tekniska högskola; Gothenburg

    Author : Thomas Petig; [2017]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Message Passing; Wireless Networks; Time Division Multiple Access; Shared Memory; Fault-Tolerance; Streaming; NP-Hardness; Distributed Algorithm; Optimisation; TDMA;

    Abstract : Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. READ MORE

  5. 5. Equilibrium and Dynamics on Complex Networkds

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Gino Del Ferraro; KTH.; [2016]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Statistical mechanics; complex networks; spin systems; non equilibrium dynamics; generalized belief propagation; message passing; cavity method; variational approaches; Physics; Fysik;

    Abstract : Complex networks are an important class of models used to describe the behaviour of a very broad category of systems which appear in different fields of science ranging from physics, biology and statistics to computer science and other disciplines. This set of models includes spin systems on a graph, neural networks, decision networks, spreading disease, financial trade, social networks and all systems which can be represented as interacting agents on some sort of graph architecture. READ MORE