Results 11 to 20 of about 959 (166)
Dijkstra's algorithm to find the nearest vaccine location [PDF]
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
openaire +3 more sources
Routing in triple loop circulants: A case of networks-on-chip [PDF]
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
Partitioning graphs to speedup Dijkstra's algorithm [PDF]
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra's algorithm. In the arc-flag approach, we allow a preprocessing of the network data to
Rolf H. Möhring +4 more
openaire +1 more source
Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra [PDF]
The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of ...
Urubkin Mikhail +4 more
doaj +1 more source
This paper presents a novel approach for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements. We propose a modified A* algorithm that incorporates network quality of service parameters into a composite ...
Robert Botez +4 more
doaj +1 more source
An Effective Algorithm for Finding Shortest Paths in Tubular Spaces
We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space.
Dang-Viet-Anh Nguyen +2 more
doaj +1 more source
Fast and efficient indoor navigation: a hybrid pathfinding approach using rapidly-exploring random tree (RRT)-connect and Dijkstra’s algorithm [PDF]
This article introduces a hybrid approach to enhance indoor pathfinding and navigation within complex multistory environments by integrating rapidly-exploring random tree (RRT)-Connect and Dijkstra’s algorithm.
Ramamoorthy Sriramulu +2 more
doaj +2 more sources
Journey to Crime Using Dijkstra's Algorithm [PDF]
This paper describes some benefits of crime mapping in a Geographic Information Systems (G.I.S.) environment. The underlining principle of Journey to Crime was discussed. Crime Spots and Police Stations in the study area were mapped, Shortest-Path, Closest Facility, Service Area and OD (Origin – Destination) Cost Matrix were determined based on ...
J. O. Olusina, J. B. Olaleye
openaire +1 more source
COV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s Algorithm
دفع وجود فيروس كورونا، المعروف باسم COVID -19، العديد من الباحثين إلى دراسة طريقة انتشار الفيروس وآليات الدفاع المختلفة للفيروس. على سبيل التذكير، يعد الحصول على لقاح، والذي يتم إجراء الكثير من الأبحاث حوله في جميع أنحاء العالم، عملية طويلة ومكلفة ومن غير المحتمل أن يمكن علاج الوباء في الوقت المناسب.
Arnaud Watusadisi Mavakala +8 more
openaire +1 more source
Determining an optimal path for forest road construction using Dijkstra's algorithm
From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm.
A. Parsakhoo, M. Jajouzadeh
doaj +1 more source

