Results 11 to 20 of about 3,733 (151)
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 +3 more sources
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
IJID (International Journal on Informatics for Development), 2019 This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj +3 more sources
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 +4 more sources
Speeding up the Floyd–Warshall algorithm for the cycled shortest path problem
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aini, Asghar, Salehipour, Amir
openaire +4 more sources
Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm
MathematicsOrder 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 +3 more sources
Developing a Scheduler with Difference-Bound Matrices and the Floyd-Warshall Algorithm
IEEE Software, 2012 A study of difference-bound matrices and the Floyd-Warshall algorithm in the development of an online scheduler provides the backdrop for a comparison of software practice and algorithmic theory.
RIDI, LORENZO +2 more
openaire +4 more sources
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