Results 211 to 220 of about 5,425,704 (264)
Some of the next articles are maybe not open access.
Weighted Sum-Dijkstra's Algorithm in Best Path Identification based on Multiple Criteria
Journal of Computer Science & Computational Mathematics, 2018People faced decision making in choosing a suitable path for their own preferences. Usually, more than one criterion is involved in order to match with the preferences of the decision makers. The main objective of this paper was to identify the best path
Ting Hua, N. Abdullah
semanticscholar +1 more source
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
A parallelization of Dijkstra's shortest path algorithm
1998The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel.
Crauser, A. +3 more
openaire +2 more sources
Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
Mathematics of Operations Research, 2002The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc lengths represent operation durations. The graphs have two types of nodes—AND-nodes and OR-nodes.
George M. Adelson-Velsky, Eugene Levner
openaire +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
An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2022Chanchal Dudeja, Pawan Kumar
semanticscholar +1 more source
Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm
International Journal of Multimedia Data Engineering and Management, 2010The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works.
Wen-Chih Chang, Te-Hua Wang, Yan-Da Chiu
openaire +1 more source
Performance evaluation of Software-Defined Network (SDN) controllers using Dijkstra’s algorithm
Wireless networks, 2022Yinjun Zhang, Mengji Chen
semanticscholar +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 +2 more
openaire +1 more source
Dijkstra’s Algorithm — The First Look
2015I’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