Filters








715 Hits in 2.7 sec

On the Floyd–Warshall algorithm for logic programs

Christos Papadimitriou, Martha Sideri
1999 The Journal of Logic Programming  
We explore the possibility of evaluating single-rule Datalog programs eciently and with logarithmic work space by a natural extension of the Floyd±Warshall algorithm for transitive closure.  ...  The proof relies on an interesting language-theoretic concept, total ambiguity. Extensions to more general classes of programs, and more general algorithms, are discussed.  ...  Acknowledgements Many thanks to Foto Afrati for discussions on this topic, and to three referees for their criticism, and for valuable suggestions for improving the presentation.  ... 
doi:10.1016/s0743-1066(99)00013-8 fatcat:kdhy2fv5vzcbxfq2ztv7gk6pha

All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

Qingshuang Wu, Chunya Tong, Qiang Wang, Xiangfu Cheng
2013 Journal of Networks  
In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand  ...  This proposed algorithm can combine the advantages of MPI and CUDA programming model, and can realize two-level parallel computing.  ...  by the Floyd-Warshall algorithm using a dynamic programming approach on a directed graph [20] .  ... 
doi:10.4304/jnw.8.12.2797-2803 fatcat:det4bxhfqrbnlcelefbqb4i34y

Transitive Closure Of A Graph using Floyd Warshall Algorithm [article]

Abhijit Tripathy
2021 figshare.com  
A modified version of Floyd Warshall Algorithm is used to find the Transitive Closure of the graph in time complexity and space complexity.  ...  Floyd Warshall Algorithm is used to find the shortest distances between every pair of vertices in a given weighted edge Graph.  ...  What is Floyd Warshall Algorithm ? Floyd Warshall Algorithm is used to find the shortest distances between every pair of vertices in a given weighted edge Graph.  ... 
doi:10.6084/m9.figshare.14721555.v1 fatcat:2eo4i6o2ajecpmttiurdl2vraa

Index

1999 The Journal of Logic Programming  
Sideri, On the Floyd±Warshall algorithm for logic programs (1) 129±137 Pettorossi, A. and M.  ...  Taboch (2±3) 139±140 Elbl, B., A declarative semantics for depth-®rst logic programs (1) 27±66 Engelfriet, J. and H.  ... 
doi:10.1016/s0743-1066(99)00056-4 fatcat:vwkzbf7lbzdi7lsbbmf6ya5ofu

Theory learning with symmetry breaking

Jacob M. Howe, Ed Robbins, Andy King
2017 Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming - PPDP '17  
The solver used in this work exploits a data structure consisting of an incremental Floyd-Warshall matrix paired with a watch matrix that monitors the entailment status of integer difference constraints  ...  It is shown how this structure can be used to build unsatisfiable theory cores on the fly, which in turn allows theory learning to be incorporated into the solver.  ...  The first author would like to thank the University of St Andrews for support during a sabbatical and Dagstuhl seminar 14351 on decision procedures and abstract interpretation.  ... 
doi:10.1145/3131851.3131861 dblp:conf/ppdp/HoweRK17 fatcat:ltasn7t6mfczla37hv4uk35774

Scalable hybrid designs for linear algebra on reconfigurable computing systems

Ling Zhuo, V.K. Prasanna
2006 12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  
Designs are proposed for several computationally intensive applications: matrix multiplication, matrix factorization, and the Floyd-Warshall algorithm for the all-pairs shortest-paths problem.  ...  Based on the model, we propose a design methodology for hardware/software codesign.  ...  ACKNOWLEDGMENTS This work was supported by the US National Science Foundation (NSF) under Grant CCR-0311823 and in part by ACI-0305763.  ... 
doi:10.1109/icpads.2006.95 dblp:conf/icpads/ZhuoP06 fatcat:izdjkcro7fefzbctzinczj4inu

Scalable Hybrid Designs for Linear Algebra on Reconfigurable Computing Systems

Ling Zhuo, V.K. Prasanna
2008 IEEE transactions on computers  
Designs are proposed for several computationally intensive applications: matrix multiplication, matrix factorization, and the Floyd-Warshall algorithm for the all-pairs shortest-paths problem.  ...  Based on the model, we propose a design methodology for hardware/software codesign.  ...  ACKNOWLEDGMENTS This work was supported by the US National Science Foundation (NSF) under Grant CCR-0311823 and in part by ACI-0305763.  ... 
doi:10.1109/tc.2008.84 fatcat:5vxajrnymje6piwms2cwcqhxca

Comparative Evaluation of Path Finding in All Pair Shortest Path Problem for Airline Network

Nadia Moqbel Hassan Al-Zubaydi
2020 Journal of Southwest Jiaotong University  
In the field of geoformation and transportation science, the shortest path is calculated on graph mostly found in road and transportation networks, especially the network of airports of some capitals around  ...  Copious amounts of work have been carried out to discover the shortest path in the network routing for the purpose of improving its efficiency and overcoming possible problems.  ...  ACKNOWLEDGMENTS The authors would like to thank Mustansiriyah University (www.uomustansiriyah.edu.iq) Baghdad -Iraq for its support in the present work.  ... 
doi:10.35741/issn.0258-2724.55.4.3 fatcat:r4w6a5q55nbxpg2lrflumikt4a

Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles

Shylashree Nagaraja
2018 Journal of Telecommunications and Information Technology  
To get the minimum number of bends in a path, we make a modification to the Floyd-Warshall algorithm, which is constitutes the main contribution of the author presented herein.  ...  Once the graph is ready, an adjacency matrix is generated and the Floyd-Warshall all-pairs shortest path algorithm is used iteratively to identify the non-crossing shortest paths.  ...  (G==true) D[i][ j] ← D[i][ j] + ε; End if // Floyd-Warshall Algorithm with Corner Weights The modified Floyd-Warshall algorithm given as Algorithm 1.  ... 
doi:10.26636/jtit.2018.120417 fatcat:4uoot5oofzf7xkgqs3rseizsgm

Fast algorithms for anti-distance matrices as a generalization of Boolean matrices [article]

Michiel de Bondt
2017 arXiv   pre-print
We will generalize Boolean matrices in the same way, keeping matrix multiplication essentially equivalent to the Floyd-Warshall algorithm.  ...  Warshall's algorithm can be generalized to Floyd's algorithm for computing the distance matrix of a graph with weighted edges.  ...  Our implementation of the matrix multiplication and the Floyd-Warshall algorithm is not very suitable for very large matrices, since one has to take caching into account for such matrices.  ... 
arXiv:1705.08743v2 fatcat:uewi3epsqzb3bcyfgigv4wrlay

Memory, Area and Power Optimization of Digital Circuits

Laxmi Gupta, Ankita Bharti
2017 International Journal of Engineering Research and  
Shortest path algorithm such as Bellman ford and Floyd Warshall are used in retiming. These retiming techniques are explained in quantitative manner and the results are given thereafter.  ...  So by this technique computation time is reduced for processors and fast speed is achieved. This is used in real time implementation to optimize performance.  ...  Retiming is done through Linear programming technique using branch and bound algorithms such as Bellman Ford and Floyd Warshall. But Bellman Ford algorithm is used in this paper.  ... 
doi:10.17577/ijertv6is020057 fatcat:fwwazotduzcojodqgcefgrd35y

Fast Algorithm for Calculating Transitive Closures of Binary Relations in the Structure of a Network Object

Vladimir Batsamut, Sviatoslav Manzura, Oleksandr Kosiak, Viacheslav Garmash, Dmytro Kukharets
2021 International Scientific Journal of Computing  
For this indicator, the developed algorithm is compared with the well-known approaches of Bellman, Warshall-Floyd, Shimbel, which can also be used to determine the transitive closures of binary relations  ...  The proposed algorithm (the logic embedded in it) can become the basis for solving problems of monitoring the connectivity of various subscribers in data transmission networks in real time when managing  ...  At the same time, it was noted in [7] that the most efficient is the Warshall-Floyd algorithm, appropriately programmed.  ... 
doi:10.47839/ijc.20.4.2444 fatcat:23xfkdgpqvhczn3xnd4eucyili

Software Agent Finds Its Way in the Changing Environment [chapter]

Algirdas Sokas
2012 Practical Applications of Agent-Based Technology  
Floyd-Warshall algorithm, for finding shortest path from one graph node to another, presents two matrices.  ...  Floyd -Warshall algorithm is selected for finding shortest way from one graph node to another selected node. The algorithm uses intermediate node idea.  ... 
doi:10.5772/37742 fatcat:leekb36rcretjbwfap24j4hpvi

Simulation of direct mapped, k-way and fully associative cache on all pairs shortest paths algorithms

A. A. Prihozhy
2019 Sistemnyj Analiz i Prikladnaâ Informatika  
After comparing the basic and blocked Floyd-Warshall algorithms, we conclude that the blocked algorithm well localizes data accesses within one block, but it does not localize data dependencies among blocks  ...  The miss rate strongly depends on the executed algorithm.  ...  We also conclude that the blocked Floyd-Warshall algorithm overcomes the basic Floyd-Warshall algorithm in the efficiency of cache operation, but the blocked algorithm needs to be improved for very large  ... 
doi:10.21122/2309-4923-2019-4-10-18 fatcat:6lflxb3k7ffevnedvwtcul7y2i

The Bilevel Design Problem for Communication Networks on Trains: Model, Algorithm, and Verification

Yin Tian, Hong-hui Dong, Li-min Jia, Yong Qin, Si-yu Li
2014 Mathematical Problems in Engineering  
We also suggested a method to solve the CRD model, which combined the genetic algorithm and the Floyd-Warshall algorithm.  ...  with the maximum reliability under constrained cost, while the logical topology part focused on the communication paths yielding minimum delay based on the physical topology delivered from upper level  ...  Acknowledgments The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper.  ... 
doi:10.1155/2014/840619 fatcat:vlgbyufsgza75jofbpoog3csxu
« Previous Showing results 1 — 15 out of 715 results