Results 71 to 80 of about 959 (166)

The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application

open access: yesDemonstratio Mathematica
In this article, we study the application of NetworkX, a Python library for dealing with traffic networks, to the problem of signal optimization at a single intersection.
Jovanović Aleksandar   +3 more
doaj   +1 more source

PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP

open access: yesE-Jurnal Matematika
A graph is a diagram that contains specific information.  One concept in graphs that can solve real-life problems is the concept of trees, which consists of various types of trees used to solve problems in life, such as finding the minimum path using the
LIKA HANIFA   +2 more
doaj   +1 more source

Node Detection and Tracking in Smart Cities Based on Internet of Things and Machine Learning

open access: yesUHD Journal of Science and Technology, 2019
It is essential to know that using technologies in a good manner will facilitate human live. Internet of Things (IoT) used widely due to developments in information and verbal exchange technologies.
Ramyar A. Teimoor, Aso M. Darwesh
doaj   +1 more source

Algorithms for Searching the Shortest Path and Its Modification

open access: yesЦифровая трансформация, 2016
The article presents an overview of the main trends and methods of searching the shortest path information transmission in the telecommunications networks. The basic algorithms and their modifications are described.
N. I. Listopad   +2 more
doaj   +2 more sources

Smart Indoor Parking System Based on Dijkstra’s Algorithm

open access: yesInternational Journal of Electrical Engineering and Applied Sciences, 2019
Smart Indoor Parking System is a parking system that assigns the car to the nearest parking to the entrance by using Dijkstra’s Algorithm and assigns according to the size of the car.
K.I. Mohammad Ata   +4 more
doaj  

Time and Memory Trade-Offs in Shortest-Path Algorithms Across Graph Topologies: A*, Bellman–Ford, Dijkstra, AI-Augmented A* and a Neural Baseline

open access: yesComputers
This study presents a comparative evaluation of Dijkstra’s algorithm, A*, Bellman-Ford, AI-Augmented A* and a neural AI-based model for shortest-path computation across diverse graph topologies, with a focus on time efficiency and memory consumption ...
Nahier Aldhafferi
doaj   +1 more source

Domain decomposition of finite element models using dijkstra’s algorithm

open access: yesСистемный анализ и прикладная информатика
The paper proposes an algorithm for decomposing regions of a finite element model (FEM) for the integration of unified cellular structures in the design of lightweight parts.
I. V. Ogorodnik, Yu. V. Polozkov
doaj   +1 more source

Home - About - Disclaimer - Privacy