Results 71 to 80 of about 3,733 (151)
FLOYD–WARSHALL ALGORITHM FOR SHORTEST ROUTE CALCULATION BETWEEN LATVIA'S CITIES
HUMAN. ENVIRONMENT. TECHNOLOGIES. Proceedings of the Students International Scientific and Practical Conference, 2019 The Floyd–Warshall algorithm is a good choice for computing paths between all pairs of vertices indense graphs, in which most or all pairs of vertices are connected by edges. For sparse graphs with non-negative edgeweights, a better choice is to use Dijkstra's algorithm from each possible starting vertex.
Gavars, Raivis +3 more
openaire +3 more sources
IET Renewable Power Generation, Volume 19, Issue 1, January/December 2025.This paper addresses the problem of a 500‐kV main grid partition planning by proposing a partition method based on complex network theory and an improved multi‐objective cuckoo search optimisation (MOCSO) algorithm to achieve grid optimal partition and the generation of key channel set.
Xun Lu, Xianfu Gong, Peng Wang
wiley +1 more source
An iterated greedy algorithm with variable reconstruction size for the obnoxious p‐median problem
International Transactions in Operational Research, Volume 32, Issue 1, Page 144-175, January 2025.Abstract The obnoxious p$p$‐median problem is a facility location problem where we maximise the sum of the distances between each client point and its nearest facility. Since it is nondeterministic polynomial‐time (NP)‐hard, most algorithms designed for the problem follow metaheuristic strategies to find high‐quality solutions in affordable time but ...
Seyed Mousavi +2 more
wiley +1 more source
Image Redundancy Filtering for Panorama Stitching
IEEE Access, 2020 In this paper, we designed a novel framework for massive image panorama stitching, which aims to resolve image redundancy, alignment error accumulation and perspective distortion accumulation of the stitching process.
Xin Wei +6 more
doaj +1 more source
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
, 2016 The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "$\parallel$" (parallel) and "$;$" (serial), are insufficient in expressing "partial dependencies" or "partial ...
Dinh, David +2 more
core +1 more source
A Selection of Bandung City Travel Route Using The FLOYD-WARSHALL Algorithm
International Journal of Integrated Engineering, 2020 The rapid development of information and technology, the city of Bandung tourism has also increased. However, tourists who visit the city of Bandung have problems with a limited time when visiting Bandung tourist attractions. Traffic congestion, distance, and the number of tourist destinations are the problems for tourists travel.
Muhammad Ghifari Arfananda +2 more
openaire +1 more source
Journal of Advanced Transportation, Volume 2025, Issue 1, 2025.Road network connectivity is an important indicator for measuring the operational efficiency and reliability of urban road networks, and it plays an important role in supporting traffic planning and management decisions. The implementation of traffic management measures, such as traffic bans and temporary traffic flow changes, will restrict access to ...
Ruru Xing +6 more
wiley +1 more source
Implementasi Algortima Floyd-Warshall Untuk Menentukan Jarak Terdekat Pada Rute Trans Musi Palembang [PDF]
, 2014 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
Improved Floyd-Warshall Algorithm for Solving Travelling Salesman Problem
Jagannath University Journal of ScienceThe shortest path problem is a fundamental challenge in graph theory, focused on identifying the most efficient routes between nodes in a network. It stands as one of the extensively researched combinatorial optimization problems. In this paper, we explained the fundamental concepts of shortest path algorithms, with a particular emphasis on Floyd ...
Solima Khanam +2 more
openaire +1 more source
Leveraging Nonassociative Algebra for Spectral Analysis of Anomalies in IoT
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.The constantly changing characteristics of distributed networks and Internet of Things and additionally their susceptibility to anomalies render maintaining security and resilience complicated. This research provides a spectral‐based anomaly detection framework connected with nonassociative algebra, inverse property quasigroup.
Faizah D. Alanazi, Chong Lin
wiley +1 more source