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 32 for “"Shortest Path Algorithm"”.
-
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, …
-
An approximate shortest path algorithm for hierarchical networks
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1997.
-
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.
-
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 …
-
Strategic algorithms
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components are, for example, uncertainty and economic incentives. Therefore, modem …
-
Automating journey fare calculation for transport for London
… on the zonal fare structure. Multiple feasible paths often exist within the network for a given origin-destination pair, each of which may produce a different journey fare. Thus, manually adjusting journey fares after any alteration of the network or fare structure is a time consuming task for …
-
Indoor navigation for passengers in underground transit stations using smartphones
… are made about the indoor space and the path tile user is taking, unlike previous approaches. A Bayesian feature-based particle filter localization model is developed to estimate the user's location. A motion model with step detection and heading inference is developed from phone sensor …
-
A study of open payment fare systems : system design, fare engine algorithm and GTFS extension
… bankcard or a mobile phone. A trip construction algorithm based on a finite state machine is proposed to automatically group tap events from a single user into trip segments according to the MTA's fare rules and send them to a fare engine for fare calculation. The trip construction algorithm …
-
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 …
-
Application of user equilibrium traffic assignment in evacuation modelling
… The trip distribution process and the shortest path algorithm has been modified appropriately to suit the user equilibrium assignment.
-
Loop detection and prevention mechanism in multiprotocol label switching
The extended color thread algorithm is based on running a thread hop by hop before the labels are distributed inside a MPLS Cloud Since the path for the data packets is set beforehand, the loop formation occurs at the control path. The shortest paths between selected source and destination have …
-
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 …
-
VLSI Physical Design for Manufacturability and Reliability
In Chapter 2, we present an optimal algorithm to generate the twist pattern for the complementary bus structure, reducing the noise as well as handling design changes. In Chapter 3, another bus optimization is present to reduce the power consumption in memory address bus for specific applications. …
-
GIS based optimal design of sewer networks and pump stations
… downstream subwatersheds via a force main. The path and destination of each force main in the system is determined by applying the Dijkstra's shortest path algorithm to select the least cost path from a set of potential paths. This method seeks to minimize the total dynamic head. A modified …
-
Exploring Personalized Route Recommendation Based on Travel Behaviors of Historical GPS Trajectories
… maximum probability route computation with the shortest path algorithm, resulting in the most likely route to be taken by a user. Experiments conducted on two real GPS trajectory data sets demonstrate the efficiency and effectiveness of the proposed method. In addition, a web-based geographic …
-
Game Theory Approach to Transportation Network Vulnerability Measurement
… such, high-volume edges with limited alternative paths represent system vulnerabilities – a feature of transportation networks that has been exploited in the past to identify critical components. In this thesis, a mixed-strategy, two opponents, non-zero sum, combinatorial game theoretical …
-
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 …
-
Energetic Path Finding Across Massive Terrain Data
… a human-centered cost metric. By comparing the paths generated by our software with known historical trails, we demonstrate how the tool can indicate likely trails used by ancient travelers. In addition, this new tool provides novel visualizations to better help the user understand alternate …
-
Low probability-high consequence considerations in a multiobjective approach to risk management
… problem we wish to address involves finding a path that minimizes the conditional expectation of a catastrophic outcome such that the expected risk is lesser than or equal to a pre-determined value, v. The value v, is user-prescribed and is prompted by the solution to the shortest path problem …
-
Robust multi-UAV planning in dynamic and uncertain environments
… maximal efficiency of the team activities. These algorithms must be fast to enable rapid replanning in a dynamic environment. The planner must also be robust to uncertainty in the situational awareness. This thesis investigates the impact of information uncertainty and environmental changes to the …
Page 1 of 2