Results 201 to 210 of about 2,337,392 (235)

Routing space Internet based on Dijkstra's algorithm

2009 First Asian Himalayas International Conference on Internet, 2009
Space 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, Guo-shun Li, Sheng-tian Zhang   +2 more
openaire   +1 more source

Study the optimization of Dijkstra’s Algorithm

Journal of Ravishankar University (PART-B)
This paper presents an optimized approach to the shortest path problem, a fundamental concern in graph theory, by improving node selection and data storage. The traditional Dijkstra's algorithm is enhanced by introducing a novel node selection strategy that prioritizes nodes with the most significant impact on the shortest path, minimizing redundant
Parmanand Parmanand, Sahdev Sahdev, Anuradha Dwivedi   +2 more
openaire   +1 more source

Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game

2008
This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories.
Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
openaire   +2 more sources

Dijkstra’s Algorithm – The Closest Look

2015
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it.
openaire   +1 more source

Dijkstra’s Algorithm — The First Look

2015
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading:
openaire   +1 more source

A generalization of Dijkstra's algorithm

Information Processing Letters, 1977
openaire   +2 more sources

A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm

Electronics, 2023
Zhiqiang Xie, Zhenjiang Tan
exaly  

A methodology based on Dijkstra's algorithm and mathematical programming for optimal evacuation in process plants in the event of major tank fires

Reliability Engineering and System Safety, 2023
Nima Khakzad
exaly  

Dijkstra's algorithm

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute

IEEE Access, 2021
Dan-Dan Zhu, Jun-Qing Sun
exaly