Sökning: "disjoint"

Visar resultat 16 - 20 av 44 avhandlingar innehållade ordet disjoint.

  1. 16. Multiwavelet analysis on fractals

    Författare :Andreas Brodin; Alf Jonsson; Per-Anders Ivert; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Wavelets; Fractals; Pointwise convergence; Besov spaces; Regularization; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis consists of an introduction and a summary, followed by two papers, both of them on the topic of function spaces on fractals. Paper I: Andreas Brodin, Pointwise Convergence of Haar type Wavelets on Self-Similar Sets, Manuscript. LÄS MER

  3. 17. Distributed connectivity algorithms

    Författare :Esther Jennings; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : The goal of this research is to design efficient distributed algorithms which execute on an arbitrary network to recognize special connectivity structures within that network. In some cases, we also consider the maintenance of these special structures in dynamically changing networks. LÄS MER

  4. 18. Dominator-based Algorithms in Logic Synthesis and Verification

    Författare :René Krenz-Bååth; Johnny Öberg; Joao Marques-Silva; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; graph dominators; formal verification; logic synthesis; equivalence checking; decomposition; Electrical engineering; Elektroteknik;

    Sammanfattning : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. LÄS MER

  5. 19. 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. 20. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Synchronization Primitives; Lock-free Binary search tree; Lock-free; Concurrent Data Structures;

    Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER