Results 91 to 100 of about 5,019,245 (200)
Exploring the Advantages of Layout Procedure with Fully‐Connected Quantum Computing Technologies
This article presents a layout synthesis library supporting superconducting transmon qubits, quantum dots, nuclear magnetic resonance (NMR), and trapped ions. It includes promising algorithms in the literature adapted to the various technologies and new algorithms for evaluating the potential benefits of a routing stage in the case of fully connected ...
Andrea Russo +4 more
wiley +1 more source
We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it destroys ...
Axelsen H. B. +7 more
core +1 more source
Despite there are significant advancements in modern power systems, blackouts remain a potential risk, necessitating efficient restoration strategies. This paper introduces an innovative concept for power system restoration, focusing on balancing active and reactive power while ensuring voltage stability.
Srijan Khadka +7 more
wiley +1 more source
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
Penentuan Jarak Terpendek Rute Transmusi dengan Algoritma Floyd-Warshall [PDF]
Transmusi merupakan sarana transportasi pulik di kota Palembang. Sepanjang rute transmusi tersedia halte-halte keberangkatan dan kedatangan.Kebanyakan penumpang kesulitan ketika harus menentukan jarak terdekat dari satu tempat ke ...
Bendi, R. Kristoforus Jawa +1 more
core
Regional protection based on multisource information of a regional power network depends on communication technology. A partition strategy considering communication constraints and implementation techniques must be considered to realize the regional ...
Zhenxing Li +5 more
doaj +1 more source
Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm
The shortest path problem is to find a path between two vertices on a given graph, such that the sum of the weights on its constituent edges is minimized.
Pawan Kumar
semanticscholar +1 more source
Tourism is one of the activities carried out for recreation or leisure in a place with a variety of purposes and objectives. In Indonesia, many cities provide attractive tourism places, and one of them is the city of Yogyakarta.
Baltra Agusti Pramajuri +3 more
semanticscholar +1 more source
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are ...
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
PERBANDINGAN ALGORITMA A*, DIJKSTRA DAN FLOYD WARSHALL UNTUK MENENTUKAN JALUR TERPENDEK PADA PERMAINAN “BACTERIA DEFENSE” [PDF]
Algoritma Pathfinding atau pencarian jalur tercepat merupakan salah satu varian algoritma yang sering diterapkan pada permainan. Penelitian ini menggunakan 3 jenis algoritma pathfinding yaiu algoritma A Star, Dijkstra dan Floyd ...
Cahyadi, M. Azan +3 more
core

