Advanced search

Showing result 1 - 5 of 46 swedish dissertations matching the above criteria.

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

    Author : Vladimir Savic; Santiago Zazo; Spain Technical University of Madrid; []
    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

    Author : Jesper Wilhelmsson; Konstantinos Sagonas; Uppsala universitet; []
    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. Compile-time Safety and Runtime Performance in Programming Frameworks for Distributed Systems

    Author : Lars Kroll; Seif Haridi; Jim Dowling; Peter Van Roy; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; distributed systems; distributed computing; programming systems; programming languages; computer science; domain specific languages; message-passing; actor model; component model; Informations- och kommunikationsteknik; Information and Communication Technology;

    Abstract : Distributed Systems, that is systems that must tolerate partial failures while exploiting parallelism, are a fundamental part of the software landscape today. Yet, their development and design still pose many challenges to developers when it comes to reliability and performance, and these challenges often have a negative impact on developer productivity. READ MORE

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

    Author : Thomas Petig; Chalmers tekniska högskola; []
    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

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

    Author : Thomas Petig; Chalmers tekniska högskola; []
    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