Results 51 to 60 of about 3,982 (139)
Evaluation of Shortest Paths in Road Network [PDF]
Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based ...
Farrukh Shehzad, Muhammad Akbar Ali Shah
doaj
Cloud radio access network (C-RAN) is considered as a promising architecture for 5G with advantages of green energy, convenient resources allocation. In this paper, we explore the feasibility of C-RAN for high-speed railway (HSR) scenarios.
Botao Han +7 more
doaj +1 more source
Implementasi Algortima Floyd-Warshall Untuk Menentukan Jarak Terdekat Pada Rute Trans Musi Palembang [PDF]
Trans musi is public transportation in the city of Palembang . Along the corridor there are shelters dismissal . The more stops dismissal of the passengers or potential passengers would find it difficult to determine the shortest distance between stops .
Kriswanto, Y. Rudi
core
Floyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj +1 more source
A Study on Price-Based Charging Strategy for Electric Vehicles on Expressways
With the large-scale adoption of electric vehicles (EVs) on expressways, the exploration of a guiding-based charging method to effectively adjust interactions between EVs and the fast charging stations (CSs) is urgently needed.
Lixing Chen +3 more
doaj +1 more source
Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm
Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area.
Noraimi Azlin Mohd Nordin +3 more
doaj +1 more source
Floyd-Warshall Algorithm 1 [PDF]
: There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum.
Ajay Somkuwar +2 more
core
Learning Generative Models across Incomparable Spaces
Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety.
Alvarez-Melis, David +3 more
core +1 more source
Perancangan Peta Evakuasi Menggunakan Algoritma Floyd- Warshall untuk Penentuan Lintasan Terpendek: Studi Kasus [PDF]
Abstrak Peta evakuasi sangat penting bagi suatu rumah sakit. Hal ini dikarenakan untuk mengurangi resiko saat terjadi bencana (gempa bumi) dan sebagai syarat akreditasi untuk memperoleh akreditasi suatu rumah sakit.
Iftadi, Irwan +2 more
core
New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes
In real-world networks, many problems imply finding the All-Pairs Shortest Paths (APSP) and their distances in a graph. Solving the large-scale APSP problem on modern multi-processor (multi-core) systems is the key for various application domains.
A. A. Prihozhy, O. N. Karasik
doaj +1 more source

