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 87 for “"Shortest Path Algorithm"”.

  1. 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)

  2. Stochastic shortest path algorithm based on Lagrangian relaxation

    In VLSI circuit design, graph algorithms are widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the effects of process variation become more crucial and design parameters also change. Hence, taking stochastic variations into account, …

    uiuc Repository record for Stochastic shortest path algorithm based on Lagrangian relaxation (opens in a new tab)

  3. Development of a dynamic shortest path algorithm and a traffic simulation model

    Shortest path determination in a dynamic transportation network has been a real challenge where network traffic scenario changes continuously. The shortest path between any two nodes in the network depends not only on the travel time of links that constitutes the path but also on the time spent at …

    concordia Download PDF for Development of a dynamic shortest path algorithm and a traffic simulation model (opens in a new tab)

  4. Efficient Domain Decomposition Algorithms and Applications in Transportation and Structural Engineering

    … domain decomposition partitioning algorithm is proposed to break a large domain into smaller sub-domains, in such a way as to minimize the number of system boundary nodes and to balance the work load for each sub-domain. This new domain decomposition algorithm is based on the …

    odu Repository record for Efficient Domain Decomposition Algorithms and Applications in Transportation and Structural Engineering (opens in a new tab)

  5. On the shortest path and minimum spanning tree problems

    The shortest path and minimum spanning tree problems are two of the classic textbook problems in combinatorial optimization. They are simple to describe and admit simple polynomial-time algorithms. However, despite years of concerted research effort, the asymptotic complexity of these problems …

    texas Repository record for On the shortest path and minimum spanning tree problems (opens in a new tab)

  6. Technology and Strategic Management Decision-Making as a Constrained Shortest Path Problem

    A constrained shortest path algorithm is developed and implemented in Matlab to optimize the management decision-making process, which is a potential tool for managers. An empirical analysis is performed using Statistics Canada’s Workplace and Employee Survey (WES), which consists of variables …

    waterloo Repository record for Technology and Strategic Management Decision-Making as a Constrained Shortest Path Problem (opens in a new tab)

  7. Development of a GIS-based routing model

    … tools adopted is still the conventional "Shortest Path Algorithm", the definition of route optimization functions and the means to employ "Shortest Path Algorithm" are different from conventional procedures; Geographic Information Systems (GIS), have been widely used as a spatial database …

    unlv Repository record for Development of a GIS-based routing model (opens in a new tab) Download PDF for Development of a GIS-based routing model (opens in a new tab)

  8. The online and offline properties of routing algorithms in MPLS

    … We evaluate the performance of five routing algorithms: the shortest path algorithm, the widest-shortest path algorithm, the shortest-widest path algorithm, the minimum interference routing algorithm, and the profile-based routing algorithm. In addition, we investigate the sensitivity of …

    ubc Repository record for The online and offline properties of routing algorithms in MPLS (opens in a new tab) Download PDF for The online and offline properties of routing algorithms in MPLS (opens in a new tab)

  9. Ear Contour Detection and Modeling Using Statistical Shape Models

    … Active Shape Models (ASM) and Dijkstra's shortest path algorithm to devise a shape model of the ear using geometric parameters and mark an accurate contour around the ear using only 2D color images. The Viola Jones Haar Cascades classifier is used to mark a rectangular region around the …

    clemson Repository record for Ear Contour Detection and Modeling Using Statistical Shape Models (opens in a new tab)

  10. Trajectory based Routing using Frequented Paths

    … congestion by using next-generation routing algorithms. The variety of spatial big data means that a single “One-size-fits-all” algorithm will not be able to answer all our queries. We would rather need a number of specialized algorithms that can work together to answer these questions. The …

    umn Repository record for Trajectory based Routing using Frequented Paths (opens in a new tab)

  11. 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)

  12. Detours admitting short paths

    Finding shortest paths between two vertices in a weighted graph is a well explored problem and several efficient algorithms for solving it have been reported. We propose a new variation of this problem which we call the Detour Admitting Shortest Path Problem (DASPP).We present an efficient …

    unlv Repository record for Detours admitting short paths (opens in a new tab) Download PDF for Detours admitting short paths (opens in a new tab)

  13. On labeled paths

    … investigation of their intersection, the labeled paths. This dissertation examines three results in the area of labeled path problems. The first result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The …

    alabama Repository record for On labeled paths (opens in a new tab)

  14. A Grid-Based Path Planning Approach for a Two Vehicle Team with Localization Constraints

    This research proposes a path-finding method for two unmanned vehicles with localization constraints using a modified shortest-path algorithm. A beacon vehicle has GPS or other absolute positioning information, and a target vehicle has only bearing information taken relative to the beacon vehicle …

    tamu Repository record for A Grid-Based Path Planning Approach for a Two Vehicle Team with Localization Constraints (opens in a new tab)

  15. Optimal Path Queries in Very Large Spatial Databases

    … or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra's shortest path algorithm is one of the most popular algorithms for the unconstrained route query problem. The constrained route query problem is more …

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

  16. Creating a multi-floor building and developing user navigation assistance in the virtual environment

    … functions, walking through and optimal path navigation guiding tour, developed in the virtual environment helps users navigating in the virtual environment. Walking through allows users to navigate freely to obtain the spatial and geographical information of the virtual environment. …

    manitoba Repository record for Creating a multi-floor building and developing user navigation assistance in the virtual environment (opens in a new tab)

  17. Integer programming formulation for contention aware connected dominating set in wireless multi-hop network

    … we use one state-of-art approach based on the shortest path algorithm, and ours one is based on the number of connected components.We propose IP formulation of selection forwarding-nodes based on Dominant Pruning and Contention-aware Dominant Pruning. The result shows that our approach performs …

    lethbridge Repository record for Integer programming formulation for contention aware connected dominating set in wireless multi-hop network (opens in a new tab)

Page 1 of 5