Sökning: "algorithms"

Visar resultat 1 - 5 av 1732 avhandlingar innehållade ordet algorithms.

  1. 1. Asynchronous Algorithms for Large-Scale Optimization Analysis and Implementation

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Arda Aytekin; KTH.; [2017]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex optimization; optimization; asynchronous algorithms; algorithms; parallel algorithms; large-scale; big data; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : This thesis proposes and analyzes several first-order methods for convex optimization, designed for parallel implementation in shared and distributed memory architectures. The theoretical focus is on designing algorithms that can run asynchronously, allowing computing nodes to execute their tasks with stale information without jeopardizing convergence to the optimal solution. LÄS MER

  2. 2. Studies in Efficient Discrete Algorithms

    Detta är en avhandling från Lund University, Faculty of Science, Centre for Mathematical Sciences, Mathematics

    Författare :DZMITRY SLEDNEU; Lunds universitet.; Lund University.; [2016-08]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

    Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

  3. 3. Constructing Evolutionary Trees - Algorithms and Complexity

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Anna Östlin; Lunds universitet.; Lund University.; [2001]
    Nyckelord :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;

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

  4. 4. Classical and quantum dynamics with discrete time : theory and algorithms

    Detta är en avhandling från Växjö Universitet

    Författare :Yaroslav Volovich; Växjö universitet.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; discrete time; quantum dynamics; MATHEMATICS; MATEMATIK;

    Sammanfattning : We study classical and quantum dynamics with discrete time: theory and algorithms.... LÄS MER

  5. 5. Compressed Sensing Algorithms and Applications

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Dennis Sundman; KTH.; KTH.; [2012]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; compressed sensing; greedy pursuits; subspace pursuit; orthogonal matching pursuit; power spectral density estimation; distributed compressed sensing;

    Sammanfattning : The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. LÄS MER