Results 11 to 20 of about 16,261 (217)
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
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
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
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
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
Determining an optimal path for forest road construction using Dijkstra's algorithm
Journal of Forest Science, 2016 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
Fast and efficient indoor navigation: a hybrid pathfinding approach using rapidly-exploring random tree (RRT)-connect and Dijkstra’s algorithm [PDF]
PeerJ Computer ScienceThis 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
HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments
ISPRS International Journal of Geo-Information, 2013 Low-cost robots are characterized by low computational resources and limited energy supply. Path planning algorithms aim to find the optimal path between two points so the robot consumes as little energy as possible.
Javier Garrido +5 more
doaj +1 more source
A Dijkstra-Based Approach to Fuelbreak Planning
Fire, 2023 One of the most effective methods of preventing large-scale wildfires is creating fuelbreaks, buffer zones whose purpose is to stop or delay the spread of the fire, providing firefighters an opportunity to control the fire. Fuelbreaks are already applied
Assaf Shmuel, Eyal Heifetz
doaj +1 more source