Sökning: "Probabilistic analysis of algorithms"

Visar resultat 1 - 5 av 45 avhandlingar innehållade orden Probabilistic analysis of algorithms.

  1. 1. Modelling and Analysis of Probabilistic Networks

    Författare :Amin Kaveh; Matteo Magnani; Christian Rohner; Aristides Gionis; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Probabilistic Networks; Local Measures; Modelling; Clustering; Computer Science; Datavetenskap;

    Sammanfattning : As empirical data collection and inference is often an imperfect process, and many systems can be represented as networks, it is important to develop modelling and analysis methods for imperfect network data. The main focus of this dissertation is the probabilistic network model G = (V, E, p) in which each edge is associated with an independent existence probability. LÄS MER

  3. 2. Integrative Analysis of Dynamic Networks

    Författare :Vinay Jethava; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Lovasz theta function; dynamic networks; integrative analysis; probabilistic graphical models; support vector machines; graph kernels;

    Sammanfattning : Networks play a central role in several disciplines such as computational biology, social network analysis, transportationplanning and many others; and consequently, several methods have been developed for network analysis. However, in many cases, the study of a single network is insufficient to discover patterns with multiple facets and subtlesignals. LÄS MER

  4. 3. Approximation of pluricomplex Green functions : A probabilistic approach

    Författare :Azza Alghamdi; Maciej Klimek; Kaj Nyström; Anna Zdunik; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; pluricomplex Green function; pluriregular sets; Bernstein-Markov property; Bergman function; nearly orthonormal polynomials; orthogonal polynomials; Monte Carlo simulation; composite Julia sets; Julia sets; iterated function systems; the chaos game.;

    Sammanfattning : This PhD thesis focuses on probabilistic methods of approximation of pluricomplex Green functions and is based on four papers.The thesis begins with a general introduction to the use of pluricomplex Green functions in multidimensional complex analysis and a review of their main properties. LÄS MER

  5. 4. Probabilistic and Experimental Analysis of Heuristic Algorithms for the Multiple-Depot Vehicle-Routing Problem

    Författare :Libertad Tansini; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; probabilistic analysis; Multi-Depot Vehicle-Routing problem; heuristics; Time-Windows;

    Sammanfattning : The aim of this thesis is to analyze different heuristic algorithms for solving the Multi-Depot Vehicle-Routing problem (MDVRP) with k depots and n points to be serviced (customers). The objective is to produce a set of service routes which minimizes the total distance traveled. Heuristic approaches are essential since the problem is NP-hard. LÄS MER

  7. 5. On the Design and Analysis of Consensus Protocols for Automotive Electronic Systems

    Författare :Negin Fathollah Nejad Asl; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Communication Failures; Consensus; Distributed Algorithms; Automotive Systems; Probabilistic Analysis;

    Sammanfattning : 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. LÄS MER