Essays about: "An algorithm for finding shortest path"
Showing result 1 - 5 of 6 essays containing the words An algorithm for finding shortest path.
-
1. Security Rounds : Enhancing Efficiency and Documentation
University essay from Högskolan i HalmstadAbstract : Security rounds are an important part of the security routines for manyorganizations and companies. This project aims to improve the handling ofsecurity risks and increase safety and efficiency in areas where securitypatrols are conducted. READ MORE
-
2. Shortest Path Routing in a Road Network:Finding an Easily Implementable Algorithm GivenEfficiency Constraints
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : This thesis, conducted at Norconsult Astando AB, investigates and finds the best performing algorithm for routing in a road network given a set of constraints. The constraintsare mainly performance oriented and also the algorithm must not be too complex to implement. READ MORE
-
3. Automatic geospatial web service composition for developing a routing system
University essay from Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapAbstract : Routing or path finding is one of the most popular services, which is widely used by citizens and tourists, around the world. These systems, which are generally developed based on [i]WebGIS[/i] provide users with the capability of introducing a start and an end point and then to observe the optimum (e.g. shortest) path between these two points. READ MORE
-
4. Comparative Performance Analysis of MANET Routing Protocols in Internet Based Mobile Ad-hoc Networks
University essay from Institutionen för datavetenskap, fysik och matematik, DFMAbstract : In crucial times, such as natural disasters like Earthquakes, Floods, military attack, rescue and emergency operations, etc., it is not possible to maintain an infrastructure. In these situations, wireless Mobile Ad-Hoc networks can be an alternative to wired networks. READ MORE
-
5. An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks
University essay from Institutionen för datavetenskapAbstract : This thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks. The focus has mainly been on Dijkstra‟s algorithm and different variations of it, and the algorithms have been implemented in C# for the practical tests. READ MORE