Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 846 for “"shortest path"”.

  1. New Multiobjective Shortest Path Algorithms

    … studied in this thesis is the Multiobjective Shortest Path (MOSP) problem. We focus on the problem variant with three or more objectives. It is a generalization of the classical Shortest Path problem in which arcs in the input graph are weighted with vectors instead of scalars. The main …

    fu-berlin Repository record for New Multiobjective Shortest Path Algorithms (opens in a new tab)

  2. Transportation Shortest Path Search Area Model

    <p>Although many studies on shortest-path algorithms have been conducted in the past, few of them have considered the time and effort required to obtain and update the weight property of the network arcs. For transportation-related problems – due to the size and complexity of the network – …

    utk-theses Repository record for Transportation Shortest Path Search Area Model (opens in a new tab)

  3. Learning hypertrees with shortest path queries

    … from a given family of hypergraphs using shortest path (SP) queries. An SP query specifies two vertices and asks for their distance in the target hypergraph. For various classes H of hypertrees, we present bounds on the number of queries required to learn an unknown hypertree from H. …

    regina Repository record for Learning hypertrees with shortest path queries (opens in a new tab)

  4. Shortest Path Problem with Random Rerouting

    This paper addresses a variant of the shortest path problem with a particular type of uncertainty where the route that differs from the scheduled one might be traversed with certain probability. The shortest path problem with random rerouting is modeled as an optimization problem, where in a graph …

    buffalo Repository record for Shortest Path Problem with Random Rerouting (opens in a new tab)

  5. Shortest Path Problems in Weighted Regions

    Finding a shortest path is one of the most studied problems in computational geometry. There are many variants of the problem. One such variant is the Weighted Region Problem (WRP), i.e., finding a shortest path when the underlying domain is weighted. The difficulty of finding exact weighted …

    carleton Repository record for Shortest Path Problems in Weighted Regions (opens in a new tab)

  6. Online Shortest Path with Switching Cost

    … νέο πρόβλημα της οικογένειας SOCO, το On-line Shortest Paths with Switching Cost. Χρησιμοποιώντας εργαλεία από τη βιβλιογραφία θα πάρουμε μία on-line fractional λύση του προβλήματος θυσιάζοντας ένα λογαριθμικό παράγοντα. Θα ολοκληρώσουμε παρουσιάζοντας ένα νέο rounding αλγόριθμο χρησιμοποιώντας …

    athens Repository record for Online Shortest Path with Switching Cost (opens in a new tab)

  7. The shortest path to cardiac activation.

    This thesis describes the application of the shortest path algorithm in the simulation of cardiac activation. This method is both used in the forward simulation of an electrocardiogram (ECG) as well as in the non-invasive imaging of cardiac activation and recovery. Due to the immense number of …

    radboud Repository record for The shortest path to cardiac activation. (opens in a new tab) Download PDF for The shortest path to cardiac activation. (opens in a new tab)

  8. Konfigurace směrovacího protokolu Open Shortest Path First

    … možnosti smerovacieho protokolu Open Short Path First (OSPF) v základnej konfigurácii a implementáciu do autonómneho systému. Teoretická časť rozoberá základny počítačových sietí a rozdelenie podľa rôznych kritérií. Ďalej popisuje spôsob adresovania v sieti Internet pomocou Internet Protocol …

    brno-tech Repository record for Konfigurace směrovacího protokolu Open Shortest Path First (opens in a new tab)

  9. Accelerating Shortest Path Counting on Road Networks

    Counting the number of shortest paths between two query vertices on road networks has a wide range of applications and has recently drawn significant research attention. The state-of-the-art solution builds a tree-based index using the concept of tree decomposition. However, its performance …

    unsw Repository record for Accelerating Shortest Path Counting on Road Networks (opens in a new tab)

  10. On Non-Classical Stochastic Shortest Path Problems

    The stochastic shortest path problem lies at the heart of many questions in the formal verification of probabilistic systems. It asks to find a scheduler resolving the non-deterministic choices in a weighted Markov decision process (MDP) that minimizes or maximizes the expected accumulated weight …

    qucosa-diss

  11. Shortest-path and maximal independent set in PyKokkos

    … Maximal Independent Set algorithm and a parallel Shortest Path algorithm using Lattice-Linear Predicate. These implementations showcase the versatility of PyKokkos, where it makes writing parallel operations simple and easy, while not sacrificing performance.

    texas Repository record for Shortest-path and maximal independent set in PyKokkos (opens in a new tab)

  12. Shortest Path Queries in Very Large Spatial Databases

    Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient …

    waterloo Repository record for Shortest Path Queries in Very Large Spatial Databases (opens in a new tab)

  13. Robust Shortest Path Problem: Models and Solution Algorithms

    Shortest path is a key component of several network related problems and has been widely used and applied in numerous disciplines such as transportation, logistics and telecommunication networks. This problem in the base deterministic settings lends itself to elegant and efficient solution methods. …

    wvu Repository record for Robust Shortest Path Problem: Models and Solution Algorithms (opens in a new tab)

  14. An Improved Shortest Path Algorithm for Aircraft Routing

    … aircraft to operate, subject to constraints. The shortest path problem with resource constraints is commonly used as a subproblem in solution methodologies in order to solve the aircraft routing problem. The aim of this thesis is to implement and evaluate an algorithm called a multidirectional …

    chalmers Repository record for An Improved Shortest Path Algorithm for Aircraft Routing (opens in a new tab)

  15. Fast shortest-path kernel computations using aproximate methods

    The shortest-path kernel is frequently seen in the context of graph classification, which shows up in various subjects, for example bioinformatics. However, it is not efficient enough to be applicable in practice if the graphs are too large. The purpose of this thesis is to explore the …

    chalmers Repository record for Fast shortest-path kernel computations using aproximate methods (opens in a new tab)

Page 1 of 43