Results 11 to 20 of about 46,824 (191)
Determining Travel Time and Fastest Route Using Dijkstra Algorithm and Google Map
Sistemasi: Jurnal Sistem Informasi, 2022 Dijkstra's algorithm is commonly used to determine the shortest route connecting a point as a starting node to another which acts as the end node. In this study, the UNP student dormitory acted as the starting node, while the library which is frequently ...
Suardinata Suardinata +2 more
doaj +1 more source
A Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms
مجلة بغداد للعلوم, 2020 Software Defined Network (SDN) is a new technology that separate the control plane from the data plane. SDN provides a choice in automation and programmability faster than traditional network.
Mustafa I. Salman et al.
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
A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
doaj +1 more source
Teknologi Location Based Service (Global Positioning System) Pada Perangkat Mobile
ComTech, 2010 Article presents analysis and design of software using Location Based Service (LBS) that is part of communication technology based on geographic position.
Budi Yulianto
doaj +1 more source
Journal of Engineering, 2023 Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming
Sabreen Mahmood Shukr +2 more
doaj +1 more source
Building graph-based programming strategies for reconfigurable photonic circuits [PDF]
, 2019 We have developed a graph representation of programmable photonic mesh circuits that can be used by pathfinding algorithms. We modified the Dijkstra algorithm to observe only physically possible connections in the graph, demonstrating flexible rerouting ...
Bogaerts, Wim, Chen, Xiangfeng
core +1 more source
Shortest Path Search Futsal Field Location With Dijkstra Algorithm
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2018 Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have ...
Delpiah Wahyuningsih, Erzal Syahreza
doaj +1 more source
Search for the optimal way in the network of public communication [PDF]
Transport, 2002 The problem of searching the optimal way in the network of public communication is investigated in the article. The modified Minieka algorithm and designed combined search into depth and Dijkstra algorithm method, operating by the basis of graphs are ...
A. Keršys, A. Jurkauskas
doaj +3 more sources
UniALT for regular language contrained shortest paths on a multi-modal transportation network [PDF]
, 2011 Shortest paths on road networks can be efficiently calculated using Dijkstra\u27s algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc.
Kirchler, Dominik +3 more
core +1 more source