Sökning: "k shortest paths"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden k shortest paths.

  1. 1. Memory efficient Monte Carlo methods for computing shortest paths in stochastic graphs

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Simon Wrede; [2021]
    Nyckelord :graph; shortest path; memory efficient; monte carlo;

    Sammanfattning : Threat modeling for information technology infrastructure can be done using shortest path algorithms in stochastic graphs. By modeling the infrastructure as a graph, potential vulnerabilities may be presented by computing what paths an attacker might take. LÄS MER

  3. 2. Route Planning and Design of Autonomous Underwater Mine Reconnaissance Through Multi-Vehicle Cooperation

    Master-uppsats, Linköpings universitet/Fordonssystem

    Författare :Jakob Hanskov Palm; [2020]
    Nyckelord :autonomous underwater vehicle; AUV; multi-vehicle cooperation; route planning; mine reconnaissance; travelling salesman problem; TSP; genetic algorithm; simulated annealing; dubins path;

    Sammanfattning : Autonomous underwater vehicles have become a popular countermeasure to naval mines. Saab’s AUV62-MR detects, locates and identifies mine-like objects through three phases. By extracting functionality from the AUV62-MR and placing it on a second vehicle, it is suggested that the second and third phases can be performed in parallel. LÄS MER

  4. 3. Routing in Terrestrial Free Space Optical Ad-Hoc Networks

    Master-uppsats, Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolan

    Författare :Yao Dong; Mohammad Sadegh Aminian; [2014]
    Nyckelord :Free Space Optical Ad hoc networks; routing; FSO; ITS;

    Sammanfattning : Terrestrial free-space optical (FSO) communication uses visible or infrared wavelengths to broadcast high speed data wirelessly through the atmospheric channel. The performance of terrestrial FSO channel mainly depends on the local atmospheric conditions. LÄS MER

  5. 4. K Shortest Path Implementation

    Master-uppsats, Databas och informationsteknik; Tekniska högskolan

    Författare :RadhaKrishna Nagubadi; [2013]
    Nyckelord :K Shortest Path; Yen s; Shortest Path Algorithm; Deviation paths; K shortest loopless paths;

    Sammanfattning : The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a network is a well-studied generalization of shortest path problem. The K shortest paths problem determines not only one shortest path but the K best shortest paths from s to t in an increasing order of weight of the paths. LÄS MER

  7. 5. Distance Adaptive Shared Path Protection for Elastic Optical Networks under Dynamic Traffic

    Master-uppsats, KTH/Programvaruteknik och Datorsystem, SCS

    Författare :Faik Aras Tarhan; [2013]
    Nyckelord :;

    Sammanfattning : Recently, the internet traffic demand has been compoundly rising up as a result of the increase in the number of users as well as data demand per user. That is why, Elastic Optical Networks (EONs), which employ Orthongonal Frequency Division Multiplexing (OFDM) , have been proposed to scale the demands by efficiently utilizing the spectrum as they provide finer spectrum granularity and distance adaptive modulation formatting. LÄS MER