Results 11 to 20 of about 4,817 (226)
Journey to Crime Using Dijkstra's Algorithm [PDF]
Nigerian Journal of Environmental Sciences and Technology, 2017 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
Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra [PDF]
E3S Web of Conferences, 2020 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
Sensors, 2023 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
Partitioning graphs to speedup Dijkstra's algorithm [PDF]
ACM Journal of Experimental Algorithmics, 2005 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
Proposed Approach to Increase the Reliability of Wireless Sensor Networks through Dijkstra’s Algorithm [PDF]
SHS Web of ConferencesThis study aims to improve the performance of wireless sensor networks (WSNs) using Dijkstra’s algorithm. WSNs are vital in applications like environmental monitoring and industrial processes, requiring efficient data flow and power management to extend ...
Jasim Abd Hashim Yaqin +1 more
doaj +1 more source
An Effective Algorithm for Finding Shortest Paths in Tubular Spaces
Algorithms, 2022 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
Worst-Case Routing Performance Evaluation of Sensor Networks [PDF]
, 2007 Successful sensor network applications depends heavily on the ability of these networks to reliably and reasonably perform under the worst-case scenarios, extreme and unusual events for which many such networks are designed to detect.
Soedarmadji, Edwin
core +1 more source
Robust semi-automated path extraction for visualising stenosis of the coronary arteries [PDF]
, 2008 Computed tomography angiography (CTA) is useful for diagnosing and planning treatment of heart disease. However, contrast agent in surrounding structures (such as the aorta and left ventricle) makes 3-D visualisation of the coronary arteries difficult ...
Achenbach +43 more
core +2 more sources
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network [PDF]
, 2007 In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure channel model, the necessary and sufficient conditions defined in [2] for the ...
McEliece, Robert J., Soedarmadji, Edwin
core +1 more source
International Journal of Applied Sciences and Smart Technologies, 2021 The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others.
Melki Friaswanto +2 more
doaj +1 more source