119 Hits in 1.9 sec

Computing the nxm shortest path efficiently

Tetsuo Shibuya
2000 ACM Journal of Experimental Algorithmics  
doi:10.1145/351827.384251 fatcat:ut4prmu3wjbqhay7bjsfuwi5ea

Mathematical Morphology and Binary Geodesy for Robot Navigation Planning [chapter]

F. Ortiz, S. Puente, F. Torres
2005 Lecture Notes in Computer Science  
The optimal path will be the one that minimize the direction changes of the robot. The algorithm of optimal path will be applied in several and complex 2-D environments.  ...  To obtain the optimal path we use mathematical morphology in binary worlds and the geodesic distance.  ...  Introduction In path planning for robot navigation it is necessary to know information about the environment in order to efficiently execute the navigation tasks.  ... 
doi:10.1007/11551188_13 fatcat:ocdmhlfu4jbi7kuzvvieunxbjy

Low-overhead error detection for Networks-on-Chip

Amit Berman, Idit Keidar
2009 2009 IEEE International Conference on Computer Design  
A key challenge for NoC error detection is to provide a defined detection level, while minimizing the number of redundant parity bits, using small encoder and decoder circuits, and ensuring shortest path  ...  We present Parity Routing (PaR), a novel method to reduce the number of redundant bits transmitted. PaR exploits NoC path diversity to reduce the number of redundant parity bits.  ...  However, this may not always be the case if we wish to employ shortest-path routing: if the source and the destination nodes share one coordinate (either X or Y) there is only one shortest routing path  ... 
doi:10.1109/iccd.2009.5413150 dblp:conf/iccd/BermanK09 fatcat:3pqn253hz5dfnh6j2ngw6u7rk4

Page 5738 of Mathematical Reviews Vol. , Issue 96i [page]

1996 Mathematical Reviews  
In this article, we identify a large class of shortest path problems for which a general efficient algorithm for the simultaneous solution and detection of minimal forecast horizons is developed.  ...  Summary: “Many sequential planning problems can be repre- sented as a shortest path problem in an acyclic network.  ... 

Empirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision Diagrams

A. Assi, P.W.C. Prasad, B. Mills, A. Elchouemi
2006 Journal of Computer Science  
The Average Path Length (APL) and the Shortest Path Length (SPL) have simple behavior as function of the number of variables and the number of terms used in the construction of the Sum of Products (SOPs  ...  Information about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the  ...  Definition 6 : 6 The Shortest Path Length (SPL) of a BDD denoted by SPL (BDD), is the Length of the Shortest Path from the root node to the terminal node.  ... 
doi:10.3844/jcssp.2006.236.244 fatcat:coptieq4h5c7bjwgw55hcmoqbq

An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

Sultan Alamri
2018 ISPRS International Journal of Geo-Information  
In these directed floor spaces, a routing system enabling a visitor to take the shortest path to a certain location is essential.  ...  The proposed system obtains the shortest path between objects or rooms taking into consideration the directed indoor space and the capacity of the objects to move within each room/cell.  ...  Acknowledgments: The source of our implementations can be downloaded from the following URL: https://goo. gl/USR9m8.  ... 
doi:10.3390/ijgi7040133 fatcat:wgygsbvrqzfmliv7klkw2jqcqm

Complex Network Method Towards Evaluating Industrial Symbiosis

Z. Wang, Y. Jiang, Y. Huang, X. Jia
2017 Chemical Engineering Transactions  
The integration degree of IS networks can be evaluated from the aspects of nodes and community structures.  ...  Finally, we evaluate the results of detection based on Girvan-Newman modularity and the cohesion of communities.  ...  It's the proportion of paths passed node i, among all nonredundant paths. CC(closeness centrality) It's the reciprocal of average the shortest distance between node i and others.  ... 
doi:10.3303/cet1761026 doaj:715c1a83b2d142dba850fec829cff714 fatcat:hakcycihubhyrc7olantpml7ai

Beneath African Glaciers

Anne Dundas
1925 Geographical Journal  
The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph.  ...  A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are  ...  The closed path travelled which satisfies the above constraints is referred as the Minimum Bend Shortest Closed Path (MBSCP).  ... 
doi:10.2307/1782904 fatcat:27hcuvamhbarfg7sitwc7z6lma

MnM: A Fast and Efficient Min/Max Searching in MRAM

Amitesh Sridharan, Fan Zhang, Deliang Fan
2022 Proceedings of the Great Lakes Symposium on VLSI 2022  
In this paper, we are the first to propose MnM, a novel IMC system with innovative architecture/circuit designs for fast and efficient Min/Max searching computation in emerging Spin-Orbit Torque Magnetic  ...  We also design all other required peripheral circuits for implementing complete Min/Max searching-in-MRAM computation.  ...  Min/Max searching is also the critical and most time-consuming computation in a lot of popular algorithms, such as Dijkstra's algorithm to find the shortest path in a graph, Prim's and Kruskal's algorithm  ... 
doi:10.1145/3526241.3530349 fatcat:frz7mjyho5a33jhyrcu3ckhk2a

A Dynamic Routing Algorithm for a Bio-inspired Reconfigurable Circuit [chapter]

Yann Thoma, Eduardo Sanchez, Juan-Manuel Moreno Arostegui, Gianluca Tempesti
2003 Lecture Notes in Computer Science  
creation of data paths between cells at runtime.  ...  This reconfigurable circuit is designed to ease the implementation of bio-inspired systems that bring cellular applications into play.  ...  The information provided is the sole responsibility of the authors and does not reflect the Community's opinion.  ... 
doi:10.1007/978-3-540-45234-8_66 fatcat:gppbuxhelvcarchjp5mj6p4pai

Autotuning PolyBench Benchmarks with LLVM Clang/Polly Loop Optimization Pragmas Using Bayesian Optimization [article]

Xingfu Wu, Michael Kruse, Prasanna Balaprakash, Hal Finkel, Paul Hovland, Valerie Taylor, Mary Hall
2020 arXiv   pre-print
We select six of the most complex benchmarks from the application domains of the PolyBench benchmarks (syr2k, 3mm, heat-3d, lu, covariance, and Floyd-Warshall) and apply the newly developed LLVM Clang/  ...  The experimental results show that our autotuning approach outperforms the other compiling methods to provide the smallest execution time for the benchmarks syr2k, 3mm, heat-3d, lu, and covariance with  ...  Acknowledgments This work was supported in part by LDRD funding from Argonne National Laboratory, provided by the Director, Office of Science, of the U.S.  ... 
arXiv:2010.08040v1 fatcat:b23i6afyajceloi7gceprfhj4m

A Subpath-based Logit Model to Capture the Correlation of Routes

Xinjun Lai, Jun Li, Zhi Li
2016 Promet (Zagreb)  
Moreover, the proposed method simplifies the original link-based CNL model; therefore, it alleviates the estimation and computation difficulties.  ...  The estimation and forecast validation with real data are presented, and the results suggest that the new method is practical.  ...  This algorithm finds the shortest path and then adds it to the choice set; afterwards it eliminates one link from the original shortest path, and another shortest path is generated from the modified network  ... 
doi:10.7307/ptt.v28i3.1808 fatcat:mxwcieyvzbbljeipivdcdlm6qu

A basic analysis toolkit for biological sequences

Raffaele Giancarlo, Alessandro Siragusa, Enrico Siragusa, Filippo Utro
2007 Algorithms for Molecular Biology  
The software is available at  ...  Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation.  ...  Algorithms for Molecular Biology 2007, 2:10 Acknowledgements The authors are deeply endebted to S. Sinha and M.  ... 
doi:10.1186/1748-7188-2-10 pmid:17877802 pmcid:PMC2147010 fatcat:vyp5qonh2rbstf6gplcj5xdwhm

Graph theoretic methods for the computation of disturbance decoupling feedback matrices for structured systems

J.W. van der Woude
1994 Linear Algebra and its Applications  
Further, a graph oriented method is derived for the efficient computation of a feedback that actually solves the disturbance decoupling problem.  ...  The method may also be advantageous in case some of the entries in the system matrices have an unknown value since the influence of the various entries is easy to establish. 1.  ...  For the efficient computation of these matrices the graph G may be used.  ... 
doi:10.1016/0024-3795(94)90320-4 fatcat:imoczcoywzfxjcvcbf7esi5syy

Open Cores for Digital Signal Processing [article]

Juan Camilo Valderrama-Cuervo, Alexander López-Parrado
2014 arXiv   pre-print
The FIR filter core is based on the symmetrical realization form, the IIR filter core is based on the Second Order Sections (SOS) architecture and the FFT core is based on the Radix 2^2 Single Delay Feedback  ...  processor and the Wishbone bus.  ...  López-Parrado for the given support and teachings. Alexander López-Parrado thanks Colciencias for the scholarship, and he also thanks Universidad del Quindío for the study commission.  ... 
arXiv:1402.6005v1 fatcat:mbort4miw5cgzcku5sg3msfxhi
« Previous Showing results 1 — 15 out of 119 results