Results 61 to 70 of about 3,733 (151)
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges.
Abraham, Ittai +2 more
core +1 more source
Routing Protocol based on Floyd-Warshall Algorithm Allowing Maximization of Throughput [PDF]
Routing protocol based on Floyd-Warshall algorithm which allows maximization of throughput is proposed. The metric function in the proposed routing protocol is throughput including not only send packets but also retransmission packets in order for improving effectiveness and efficiency of the network in concern.
openaire +1 more source
Extracting critical information from different modes can significantly improve the accuracy and robustness of data‐driven models in process monitoring, condition evaluation, and quality improvement. However, the existing multimode identification methods rely on prior knowledge to determine the number of modes in advance and cannot describe the ...
Yan‐Ning Sun +5 more
wiley +1 more source
Waste is defined as anything that is not utilized or discarded. Waste is not something that happens by itself; instead, it is a product of human activity. Unresolved problems are often caused by waste. Binjai City's waste problem is one example.
Dinda Permata Sari, Rina Filia Sari
doaj +1 more source
This study proposes a multi‐stage optimal allocation method for newly added electric vehicle (EV) charging stations, integrating probabilistic user behaviour analysis, fuzzy‐based service performance evaluation, and economic optimisation. Simulation results demonstrate that the proposed approach effectively balances service performance and investment ...
Yufei Wang +5 more
wiley +1 more source
Floyd–Warshall Algorithm for Sparse Graphs
The Floyd–Warshall algorithm, which uses a classic dynamic programming approach, provides a solution to the all-pairs shortest paths problem. However, for sparse graphs, iteratively applying Dijkstra’s, or some other similar algorithm from each node ...
Dani Zugan, Rok Požar, Andrej Brodnik
doaj +1 more source
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source
Analisa dan Penerapan Algoritma Floyd Warshal untuk Optimalisasi Jalur Berbasis GPS [PDF]
Makalah ini membuat tentang masalah dalam menentukan jalur terpendek atau terdekat menuju lokasi pelanggan yang memberikan keluhan, kemudian teknisi akan melakukan penugasan maintenance ke lokasi pelanggan.
Darmawan, R. (Rizki), Ghaniy, R. (Rajib)
core
An Floyd-Warshall Evolution Relations Algorithm Based on Social Networks Key Groups
Abstract With the development of the society, people increasingly frequent application in social network, the formation of social networking groups become important step in people’s life. How to analyze the evolution of social network group relations become very important.
Zhan Gao +5 more
openaire +1 more source
Optimizing Traffic Routes With Enhanced Double Q‐Learning
This paper presents a novel approach to optimizing urban traffic routes using reinforcement learning techniques. By leveraging advanced algorithms and simulation models, the study demonstrates how machine learning can improve traffic flow and reduce congestion in high‐density urban areas. The results show the potential for scalable solutions to enhance
Mayur Patil +2 more
wiley +1 more source

