Results 201 to 210 of about 5,083,450 (268)
Some of the next articles are maybe not open access.
Understanding Dijkstra Algorithm
SSRN Electronic Journal, 2013Dijkstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths ...
openaire +1 more source
Dijkstra's algorithm and Google maps
Proceedings of the 2014 ACM Southeast Regional Conference, 2014Dijkstra's Algorithm is known as the shortest path source. In this paper, we discuss this Algorithm and the applications that the algorithm has on the modern day. In this study, we provide a pseudo-code of the algorithm. It is the backbone of every navigation system. Google Maps is a typical application of this Algorithm.
Daniel R. Lanning +2 more
openaire +1 more source
Application of Improved Dijkstra Algorithm in Coastal Tourism Route Planning
Journal of Coastal Research, 2020Chen, Y., 2020. Application of improved Dijkstra algorithm in coastal tourism route planning. In: Gong, D.; Zhang, M., and Liu, R. (eds.), Advances in Coastal Research: Engineering, Industry, Economy, and Sustainable Development.
Yijing Chen
semanticscholar +1 more source
Proceedings of the International Symposium on Combinatorial Search, 2021
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
Two Block Partitioned Dijkstra Algorithms
2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to ...
Xinyu Mao, Yuxin Cheng, Haige Xiang
openaire +1 more source
Application of Dijkstra Algorithm in Path Planning for Geomagnetic Navigation
International Conference on Security and Management, 2020Path planning is one of the key technologies to realize the hidden navigation of underwater vehicles during long-haul. Path planning efficiency and accuracy are at the core of submarine track planning.
Qingya Liu +5 more
semanticscholar +1 more source
Routing space Internet based on Dijkstra's algorithm
2009 First Asian Himalayas International Conference on Internet, 2009Space Based Internets will be used to move earth observation data through satellite constellations to ground based receiving stations. Routing observation traffic in this environment is constrained by individual satellite orbits, individual satellite capabilities, observation schedules, ground station schedules, and rapidly evolving natural events ...
Xiang-ying Li +2 more
openaire +1 more source
Optimal Path Planning of Automated Guided Vehicle using Dijkstra Algorithm under Dynamic Conditions
International Conference on Robot Intelligence Technology and Applications, 2019This paper presents an optimal path planning aiming at minimization of energy consumption and decrement of operation time of an automated guided vehicle (AGV) under dynamic operation conditions in a graph containing random slopes and distances. To convey
Sungkwan Kim +3 more
semanticscholar +1 more source
Dijkstra’s algorithm and L-concave function maximization
Mathematical Programming, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murota, Kazuo, Shioura, Akiyoshi
openaire +2 more sources
Dijkstra Algorithm Based Reliability Model
2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications, 2012The increased use of virtual connections in packet switched networks, in particular over the Internet, using MPLS and GMPLS evolution has produced a significant amount of studies on traffic engineering protocols, especially with regard to the different ways to provide quality of service over connections.
Octavio J. Salcedo Parra +2 more
openaire +1 more source