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 210 for “"SHORTEST PATH"”.
-
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. …
-
Continuous-time dynamics shortest path algorithms
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
-
Stochastic shortest path games : theory and algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Communication complexity of distributed shortest path algorithms
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.
-
Dynamic shortest path algorithms for IVHS applications
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1993.
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… and maze routing, can be formulated as shortest path problems using a statistical graph model. The solution of any such graph problem will surely have a statistical distribution for its cost function value. The mean and variance, square of standard deviation, values are used as a pair of …
-
The value of information in shortest path optimization/
… an instance of an uncertain decision framework: shortest path optimization on a graph with random edge weights.
-
An approximate shortest path algorithm for hierarchical networks
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1997.
-
Stochastic and shortest path games : theory and algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Risk-bounded Programming using Constrained, Hierarchical, Stochastic Shortest Path Problems
… a constrained and hierarchical stochastic shortest path problem (HC-SSP) and then solving it using an anytime algorithm. In this thesis, we present an executive named Zeppelin, which employs a divide-and- conquer approach to solving HC-SSP, leveraging the hierarchical structure of the …
-
Analysis of Dijkstra’s and A* algorithm to find the shortest path
There are so many algorithms 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 …
-
Shortest Path Problems: Domain Restriction, Anytime Planning, and Multi-objective Optimization
Optimal path problems arise in many applications and several efficient methods are widely used for solving them on the whole domain. However, practitioners are often only interested in the solution at one specific source point, i.e. the shortest path to the exit-set from a particular starting …
-
Analysis of parallel asynchronous schemes for the auction shortest path algorithm
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.
-
Application of shortest path algorithms to find paths of minimum radiation dose
Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to …
-
The O-D shortest path problem and connectivity problems on periodic graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
-
Parallel implementations of dynamic traffic assignment models and algorithms for dynamic shortest path problems
… speedups are achieved. We design efficient shortest path algorithms to speedup the user's route choice model. We first present a framework for static shortest path algorithms, which prioritize nodes with optimal distance labels in the scan eligible list. Then we apply the framework in …
-
Cycle route network development and evaluation using spatial multi-criteria analysis and shortest path analysis
The current global trend of urbanisation has resulted in many cities today with growing transportation problems. Locally, South Africa is dealing with both urbanisation and spatial inequalities as a result of the apartheid era, with the poor very often located on the outskirts of urban areas, and …
-
Time-dependent networks : data representation techniques and shortest path algorithms with applications to transportation problems
… dynamic data, and the computation of fastest paths in continuous-time dynamic networks. We apply these methods for the following application problems: storage and communication of discrete-time dynamic transportation network data, and computation of fastest paths in traffic networks with …
Page 1 of 11