Results 21 to 30 of about 5,425,704 (264)

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

Proposed Approach to Increase the Reliability of Wireless Sensor Networks through Dijkstra’s Algorithm [PDF]

SHS Web of Conferences
This 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, Talib Hasson Saad   +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, Jérôme Szewczyk, Kanty Rabenorosoa   +2 more
doaj   +1 more source

Analysis of Dijkstra’s Algorithm and A* Algorithm in Shortest Path Problem

Journal of Physics: Conference Series, 2020
Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper’s objective is to compare those two
D. Rachmawati, Lysander Gustin
semanticscholar   +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

The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

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, Erick Alfons Lisangan, Sean Coonery Sumarta   +2 more
doaj   +1 more source

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

COV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s Algorithm

Journal of Computer Science, 2023
دفع وجود فيروس كورونا، المعروف باسم COVID -19، العديد من الباحثين إلى دراسة طريقة انتشار الفيروس وآليات الدفاع المختلفة للفيروس. على سبيل التذكير، يعد الحصول على لقاح، والذي يتم إجراء الكثير من الأبحاث حوله في جميع أنحاء العالم، عملية طويلة ومكلفة ومن غير المحتمل أن يمكن علاج الوباء في الوقت المناسب.
Arnaud Watusadisi Mavakala, Wilfried Yves Hamilton Adoni, Najib Ben Aoun, Najib Ben Aoun, Tarik Nahhal, Moez Krichen, Moez Krichen, Mohammed Alzahrani, Franck Mutombo Kalala   +8 more
openaire   +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 Science
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, Abhishek Yadav, Subha Bal Pal   +2 more
doaj   +2 more sources

Simplicial dijkstra and A* algorithms for optimal feedback planning [PDF]

2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011
This paper considers the Euclidean shortest path problem among obstacles in ℝn. Adaptations of Dijkstra's and A* algorithms are introduced that compute the approximate cost-to-go function over a simplicial complex embedded in the free space. Interpolation methods are carefully designed and analyzed so that they are proven to converge numerically to the
Yershov, Dmitry S., LaValle, Steven M.
openaire   +2 more sources