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 61 for “"Dijkstra's algorithm"”.

  1. Improve the safety and effectiveness of firelines using Dijkstra's algorithm: model development and implementation during incident

    … spatial optimization model based on Dijkstra's algorithm. We modified and implemented this algorithm on a network generated from a spatial index derived raster cost surface, and identified paths with the lowest accumulated cost. We also applied indices specified thresholds to avoid …

    colostate Repository record for Improve the safety and effectiveness of firelines using Dijkstra's algorithm: model development and implementation during incident (opens in a new tab)

  2. Research on motion planning of autonomous mobile robot

    The path planning algorithm in Yamabico is based on a variation of Dijkstra's algorithm which has time complexity of O(n2). This algorithm works well in a dynamic environment, but a faster algorithm, called the All-Pairs Minimum Cost Paths algorithm, works even faster, O(1), in the case of a static …

    nps Repository record for Research on motion planning of autonomous mobile robot (opens in a new tab)

  3. Fuel minimization of a moving vehicle in suburban traffic

    … to obtain analytical results. Therefore, we use Dijkstra's shortest path algorithm to discretize our decision problem. By ""setting nodes"" at each distance where there is a traffic light, we can model a realistic situation with an equivalent discrete graph with non negative edge costs. Each node …

    uiuc Repository record for Fuel minimization of a moving vehicle in suburban traffic (opens in a new tab)

  4. QoS-aware Service Composition and Redundant Service Removal

    … be fulfilled by individual services. Planning algorithms are frequently used to solve this problem. In addition to satisfying functional goals, recent research is geared towards selecting the best services to optimize the QoS of the business process results. It is a challenge to fulfill …

    concordia Download PDF for QoS-aware Service Composition and Redundant Service Removal (opens in a new tab)

  5. Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks

    … community traditionally uses A* as the baseline algorithm for their research methods. Research papers in the road networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and …

    denver Repository record for Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks (opens in a new tab)

  6. Implementing Dijkstra's pathfind using quantum algorithms

    … thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  7. Implementing Dijkstra's pathfind using quantum algorithms

    … thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb-retro Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  8. Alternate path routing algorithm for traffic engineering in the Internet

    … avoid this problem is to use efficient routing algorithm that efficiently maps the flow of data onto the network; The most often used routing algorithm in the internet is the shortest path algorithm (Dijkstra's algorithm). This algorithm is simple and easy to implement. But this algorithm leads …

    unlv Repository record for Alternate path routing algorithm for traffic engineering in the Internet (opens in a new tab) Download PDF for Alternate path routing algorithm for traffic engineering in the Internet (opens in a new tab)

  9. On the shortest path and minimum spanning tree problems

    … to describe and admit simple polynomial-time algorithms. However, despite years of concerted research effort, the asymptotic complexity of these problems remains unresolved. The main contributions of this dissertation are a number of asymptotically faster algorithms for the minimum spanning …

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

  10. Architecture for a hardware implementation of the OSPF protocol

    … protocols such as PNNI, OSPF and IS-IS use Dijkstra's algorithm or Bellman-Ford's algorithm to solve the shortest path problem. Today, the majority of the shortest path computations are performed in software, which is inefficient for real-time (voice and multimedia over IP) applications that …

    ottawa-retro Repository record for Architecture for a hardware implementation of the OSPF protocol (opens in a new tab)

  11. A faster algorithm for the single source shortest path problem with few distinct positive lengths

    This thesis proposes an algorithm that involves Dijkstra's algorithm to solve the Single Source Shortest Path Problem in a graph where the length of each edge is positive, and the specific case where there is a distinct number of possible lengths. Given a graph where there are n vertices, m edges, …

    wvu Repository record for A faster algorithm for the single source shortest path problem with few distinct positive lengths (opens in a new tab)

  12. Solving reachable sets on a manifold

    … toolbox of level set methods. This method uses Dijkstra's algorithm to approximate the solution to the non-linear Eikonal equation. Functions for calculating signed distances and extension velocities are also implemented. These functions use the fast marching method in their implementation. …

    ubc Repository record for Solving reachable sets on a manifold (opens in a new tab) Download PDF for Solving reachable sets on a manifold (opens in a new tab)

  13. A discovery process for initializing ad hoc underwater acoustic networks

    … process are compared with those derived from Dijkstra's algorithm. It is concluded that the network discovery process always produces a shortest-path route from a master node to any other discovered nodes in the network. Sensitivity studies on the route cost evaluation function are performed, …

    nps Repository record for A discovery process for initializing ad hoc underwater acoustic networks (opens in a new tab)

  14. A cost benefit analysis of two products of the Fleet Numerical Oceanography Center

    … (OTSR) is evaluated using an adaptation of Dijkstra's algorithm to determine the optimum routing if perfect wave height information were available compared to a purely greedy strategy capturing the shortest arc available enroute to the destination. The damage sustained is compared to actual …

    nps Repository record for A cost benefit analysis of two products of the Fleet Numerical Oceanography Center (opens in a new tab)

  15. A Statistical Model of Recreational Trails

    … using both a novel stochastic variation of Dijkstra's algorithm, and an MCMC-inspired sampler. Our experiments, on trail images and groundtruth collected in the western continental USA, show substantial improvement over those of the previous best trail-finding methods.

    arizona-thes Repository record for A Statistical Model of Recreational Trails (opens in a new tab)

  16. SMARTGUIDE: Revolutionizing the Depth and Dependability of Vision-Impaired Navigation

    … through the shortest path calculated by Dijkstra's algorithm; and (3) Obstacle Detection and Alerts, where YOLO identifies obstacles, and ZoeDepth estimates their distance to inform users of potential hazards. By adapting its responses based on user feedback, SmartGuide provides …

    vt Repository record for SMARTGUIDE: Revolutionizing the Depth and Dependability of Vision-Impaired Navigation (opens in a new tab)

  17. Searching for Shortest and Safest Paths Along Obstacle Common Tangents

    … common tangent construction and path searching algorithms to process complex geometrical shapes in an efficient and symbolically unique fashion. Dijkstra's algorithm is implemented using heuristic control for optimal path searching. The framework for utilizing constant clearance strips for safe …

    nps Repository record for Searching for Shortest and Safest Paths Along Obstacle Common Tangents (opens in a new tab)

  18. Network shortest path application for optimum track ship routing

    … Western Pacific Ocean. A binary heap version of Dijkstra's algorithm determines the optimum route given model generated wind and seas input. We test the model against recent weather data to verify the model's performance, and to historical divert route recommendations in order to validate against …

    nps Repository record for Network shortest path application for optimum track ship routing (opens in a new tab)

  19. Canvas: A fast and accurate geometric sentence alignment system using lexical cues within complex misalignment settings

    … number of these points using a modified form of Dijkstra's algorithm. The results of Canvas system are very promising, as they demonstrate that it can handle intricate misalignment patterns, with much better speed than other alignment approaches using lexical cues, and with good accuracy in …

    cuny-grad Repository record for Canvas: A fast and accurate geometric sentence alignment system using lexical cues within complex misalignment settings (opens in a new tab)

  20. End-to-end quality of service support for multimedia applications in the Internet.

    … The QoS routing agent uses a modification of Dijkstra's algorithm to find a shortest-narrowest path that accommodates the requested QoS. We present the analytical study and implementation of the main components proposed in this thesis. Then we present implementation of the architecture in an …

    ottawa-retro Repository record for End-to-end quality of service support for multimedia applications in the Internet. (opens in a new tab)

Page 1 of 4