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 39 for “"DIjkstra"”.
-
Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks
… 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 Bidirectional Dijkstra in road networks to see how they compare and to see if there is a principled explanation for …
-
Online Unmanned Ground Vehicle Mission Planning using Active Aerial Vehicle Exploration
… Both identify frontiers for exploration with the Dijkstra Frontier method using Dijkstra's Algorithm to identify a frontier with unknown space, and the other uses a bi-directional RRT to identify multiple frontiers for selection. The final algorithm developed was for to give the UGV partial plans …
-
The Approach-dependent, Time-dependent, Label-constrained Shortest Path Problem and Enhancements for the CART Algorithm with Application to Transportation Systems
… Shortest Path (PSP) algorithm and the Heap-Dijkstra (HP-Dijkstra) algorithm, and present related theoretical complexity results. In addition, we also explore various heuristic methods to curtail the search. We explore an Augmented Ellipsoidal Region Technique (A-ERT) and a Distance-Based …
-
Metaheuristic algorithms for air-route optimization under climate change
… This allows reproducible comparisons between Dijkstra’s algorithm (exact, nonnegative additive costs) and a basic Ant Colony Optimisation (ACO) solver in terms of optimality gap, convergence, and runtime. In a second stage we introduce turbulence via a normalised exposure field and integrate …
-
Shortest secure path in a Voronoi Diagram
… combination of the continuous and discrete Dijkstra algorithms. We also implemented the algorithm using CGAL.
-
Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation
… 5) a family of algorithms including C*-P, C-Dijkstra, O*-MST, O*-SCDMST, O*- Dijkstra, and O*-Greedy is identified, and case studies are performed on path finding in transportation networks, and/or fully connected graphs, either directed or undirected; and 6) O*- SCDMST is adopted to …
-
SDNoC 42: modelo de SDNoC baseada em otimização de caminhos mínimos
… the parallelism of control mechanisms using Dijkstra’s algorithm to find the best path in packet routing between switches. The approach proposes a significant improvement in communication latency by reducing the waiting time of packets in the controllers’ queue and exploring the network’s …
-
Wegpunktnavigation für Fußgänger auf Basis von standardisierten Geodateninfrastrukturen
… Berechnung der Route betrachtet. Hier wurden der Dijkstra- und der A*-Algorithmus vorgestellt. Der A*-Algorithmus ist als Erweiterung des Dijkstra-Algorithmus effizienter und dient daher in der Software zur Berechnung des kürzestenWeges. Für die Berechnung ist es zusätzlich notwendig, dass die …
-
Masochism and Decadent literature: Jean Lorrain and Joséphin Péladan
… Decadence (Emily Apter, Charles Bernheimer, Bram Dijkstra and Rita Felski), and in Sacher-Masoch (Nick Mansfield, John K. Noyes, and Anita Phillips), and his influence on Decadent writers.
-
Self-stabilizing inter-domain policy routing
… systems. This paradigm was introduced by Dijkstra in 1974. A self-stabilizing system guarantees that starting from an arbitrary state, the system converges to a legal state in a finite number of steps and remains in a legal state until another fault occurs. Such a system after any …
-
Analysis of Dijkstra’s and A* algorithm to find the shortest path
… used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms to find the …
-
Field D* pathfinding in weighted simplicial complexes
… established graph search algorithms, such as Dijkstra’s shortest path and A*, can be used. However, many environments are constructed from a set of regions that do not conform to a discrete graph. The Weighted Region Problem was proposed to address the problem of finding the shortest path …
-
Efficiently Estimating Survival Signature and Two-Terminal Reliability of Heterogeneous Networks through Multi-Objective Optimization
… and we present a fast and memory-efficient, Dijkstra-like algorithm to solve it. To the best of our knowledge, this is the first work to point out the relationship between the multi-dimensional survival signature computation and a multi-objective optimization problem. We empirically validate …
-
Incommensurate crystal optics
Contains fulltext : mmubn000001_121504395.pdf (Publisher’s version ) (Open Access)
-
Jewish and ‘Nomade’ Experiences of Internment in Occupied France, 1940-1946
This dissertation explores the experiences of internment among Jews and ‘nomades’ in Occupied France between 1940 and 1946. Drawing on a wide range of sources, many of them previously unused by historians, the dissertation contributes to scholarship seeking to recover Jews and ‘nomades’ as subjects …
-
A structural investigation of the mercury-sulphur interaction
The crystal and molecular structures of phenyl, 2-mercaptopyrimidine mercury(II) and phenyl,mercaptobenzene mercury(II) have been determined by the methods of X-ray crystallography. The interaction between mercury and sulphur is investigated. This interaction is of interest both biochemically and …
Page 1 of 2