Sökning: "shortest"

Visar resultat 16 - 20 av 155 avhandlingar innehållade ordet shortest.

  1. 16. Studies in Efficient Discrete Algorithms

    Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
    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. 17. Computer-Assisted Troubleshooting for Efficient Off-board Diagnosis

    Författare :Håkan Warnquist; Patrick Doherty; Jonas Kvarnström; Mattias Nyberg; Erik Frisk; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automated planning; diagnosis; automotive industry; troubleshooting; Bayesian networks; Computer science; Datavetenskap;

    Sammanfattning : This licentiate thesis considers computer-assisted troubleshooting of complex products such as heavy trucks. The troubleshooting task is to find and repair all faulty components in a malfunctioning system. LÄS MER

  4. 18. Molecular basis and pharmacological implications of Alzheimer amyloid ß-peptide fibril formation

    Författare :Lars Tjernberg; Karolinska Institutet; Karolinska Institutet; []
    Nyckelord :Alzheimer s disease; amyloid; fibrils; inhibitor; protease resistance; electron microscopy; fluorescence correlation spectroscopy.;

    Sammanfattning : Alzheimer's disease is a progressive neurodegenerative disease, mostly affecting elderly. The invariable deposition of protease-resistant fibrils of Alzheimer amyloid ß-peptide (Aß) in the parenchyma and blood vessels of the brain is a central event. LÄS MER

  5. 19. Using connectivity graphs to support map-related reasoning

    Författare :Peter D. Holmes; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis describes how connectivity graphs can be used to support automated as well as human reasoning about certain map-related problems. Here, the term "map" intends to denote the representation of any two-dimensional, planar surface which can be partitioned into regions of free vs. obstructed space. LÄS MER

  7. 20. Improving routing in the global Internet

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

    Sammanfattning : Routing is an important part of the Internet and even though routing in the Internet has been investigated since Internet's creation, there are still open issues. Routing protocols have been evolved since the birth of Internet. Currently the Border Gateway Protocol(BGP) is the de-facto standard inter domain routing protocol on the Internet. LÄS MER