Results 1 to 10 of about 4,817 (226)
Dijkstra's algorithm to find the nearest vaccine location. [PDF]
Procedia Comput Sci, 2023 Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, Dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The Dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time
Jason +4 more
europepmc +3 more sources
Routing in triple loop circulants: A case of networks-on-chip [PDF]
Heliyon, 2020 In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Aleksandr Yu. Romanov +1 more
doaj +2 more sources
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core +2 more sources
A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
Journal of Advanced Research in Natural and Applied Sciences, 2023 Autonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms.
Orkan Murat Çelik, Murat Köseoğlu
doaj +1 more source
A reinforcement learning approach for widest path routing in software-defined networks
ICT Express, 2023 In this paper, a routing method based on reinforcement learning (RL) under software-defined networks (SDN), namely the Q-learning widest-path routing algorithm (Q-WPRA), is proposed.
Chih-Heng Ke, Yi-Hao Tu, Yi-Wei Ma
doaj +1 more source
Targeted multiobjective Dijkstra algorithm
Networks, 2023 We introduce the Targeted Multiobjective Dijkstra Algorithm (T‐MDA), a label setting algorithm for the One‐to‐One Multiobjective Shortest Path (MOSP) Problem. It is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*‐like techniques.
Pedro Maristany de las Casas +3 more
openaire +3 more sources
Jurnal Derivat, 2021 The purpose of this study are (1) to represent the route of café location in Bumiayu in the form of graph, (2) To find a solution from the application of the Dijkstra’s algorithm to find location of café in Bumiayu, and (3) To find the recommended ...
Intan Alifiani +2 more
doaj +1 more source
APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH
E-Jurnal Matematika, 2021 Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application
RENDI SAPUTRAMA, HARTATIANA HARTATIANA
doaj +1 more source
Open pit limit optimization using dijkstra’s algorithm [PDF]
International Journal of Mining and Geo-Engineering, 2020 In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies.
Mehdi Najafi +2 more
doaj +1 more source
COV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s Algorithm
Journal of Computer Science, 2023 دفع وجود فيروس كورونا، المعروف باسم COVID -19، العديد من الباحثين إلى دراسة طريقة انتشار الفيروس وآليات الدفاع المختلفة للفيروس. على سبيل التذكير، يعد الحصول على لقاح، والذي يتم إجراء الكثير من الأبحاث حوله في جميع أنحاء العالم، عملية طويلة ومكلفة ومن غير المحتمل أن يمكن علاج الوباء في الوقت المناسب.
Arnaud Watusadisi Mavakala +8 more
openaire +1 more source