Results 31 to 40 of about 10,050 (224)
On the Floyd–Warshall algorithm for logic programs
The Journal of Logic Programming, 1999 Summary: We explore the possibility of evaluating single-rule Datalog programs efficiently and with logarithmic work space by a natural extension of the Floyd-Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated -- they are rather modest generalizations of the transitive closure. The
Papadimitriou, Christos, Sideri, Martha
openaire +1 more source
Using basis dependence distance vectors in the modified Floyd–Warshall algorithm [PDF]
Journal of Combinatorial Optimization, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bielecki, Włodzimierz +2 more
openaire +2 more sources
MENENTUKAN JALUR TERPENDEK MENGGUNAKAN ALGORITMA A* DAN ALGORITMA FLOYD WARSHAL [PDF]
, 2023 When graphs are used to solve the problem of determining the shortest route, it has become a common topic of discussion. Typically, these solutions are used to optimize aspects such as travel time.
Rianjaya, Ilham Dangu +1 more
core +1 more source
Performance Analysis of Floyd Warshall Algorithm vs Rectangular Algorithm
International Journal of Computer Applications, 2014 this paper, we have examined the comparative study of Floyd Warshall algorithm and the Rectangular algorithm. We have tested these two algorithms on random graphs generated by the Erdos - Renyi (ER) model. The evaluation of the algorithms for different probabilities show that the Floyd Warshall algorithm gives slightly better performance for dense ...
Pramod Kumar Mishra, Akanksha Singh
openaire +1 more source
Group Communication Patterns for High Performance Computing in Scala [PDF]
, 2014 We developed a Functional object-oriented Parallel framework (FooPar) for high-level high-performance computing in Scala. Central to this framework are Distributed Memory Parallel Data structures (DPDs), i.e., collections of data distributed in a shared ...
Hargreaves, Felix P. +2 more
core +1 more source
Informatika, 2023 Objectives. The problem of parallelizing computations on multicore systems is considered. On the Floyd – Warshall blocked algorithm of shortest paths search in dense graphs of large size, two types of parallelism are compared: fork-join and network ...
A. A. Prihozhy
doaj +1 more source
ALGORITMA FLOYD WARSHALL UNTUK MENENTUKAN JALUR TERPENDEK EVAKUASI TSUNAMI DI KELURAHAN SANUR
E-Jurnal Matematika, 2013 Sanur village is one of beautiful tourism spots in Bali. Sanur is located in south of Bali, Indonesia. There are many beaches in that place. Besides of beautifulness of it, Sanur potentially to be attacked by Tsunami disaster because of it is location ...
AJENG FITRAH SANI +2 more
doaj +1 more source
Algorithms, 2023 Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies.
Konstantin Gaipov +6 more
doaj +1 more source
Comparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl [PDF]
International Journal of Computer Applications, 2015 Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant.
Vikram Garg, Asad Mohammad
openaire +1 more source
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Jisuanji gongcheng, 2020 Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source