Rings Murat Demirbas Anish Arora 1 Department of Computer and Information S ien e The Ohio State University Columbus, Ohio 43210 USA Abstra t This paper presents an optimal termination dete tion algorithm for rings. The algorithm is based on Safra's and Dijkstra et al.'s [1℄ algorithm. It optimizes the time onstant of the Dijkstra & Safra algorithm from 2N 3N to 0 N , where N denotes the number...

The shortest path question is in a graph theory model question, and it is applied in many fields. The most short-path question may divide into two kinds: Single sources most short-path, all apexes to most short-path. This article mainly introduces the problem of all apexes to most short-path, and gives a new parallel algorithm of all apexes to most short-path according to the Dijkstra algorithm...

Low-cost robots are characterized by low computational resources and limited energy supply. Path planning algorithms aim to find the optimal path between two points so the robot consumes as little energy as possible. However, these algorithms were not developed considering computational limitations (i.e., processing and memory capacity). This paper presents the HCTNav path-planning algorithm (H...

Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...

In this paper we propose the idea of using Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very important issue associated with many other tasks like network routing and graph/map analysis etc. Different techniques have been used for solving the SPF problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic Algorithm, Tabu Search etc. The choice of algorith...

An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. ...

Global path planning for mobile robot using genetic algorithm and A* algorithm is investigated in this paper. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then Dijkstra algorithm is utilized for finding a feasible collision-free path, finally the global optimal path of mobile robots is obtained based...

Cognates are defined as words similar in form and meaning across two languages. Similarity in form may range from full orthographic overlap, as in English film – German Film, to partial overlap, as in English chapel – German Kapelle. Some pairs of cognate words developed historically from a common ancestor word, whereas others emerge when languages come into contact and loan each other words. L...

We develop a model for predicting verb sense from subcategorization information and integrate it into SSI-Dijkstra, a wide-coverage knowledge-based WSD algorithm. Adding syntactic knowledge in this way should correct the current poor performance of WSD systems on verbs. This paper also presents, for the first time, an evaluation of SSI-Dijkstra on a standard data set which enables a comparison ...

Citation for published version (APA): Vujii-Žagar, A., Pijning, T., Kralj, S., López, C. A., Eeuwema, W., Dijkhuizen, L., & Dijkstra, B. W. (2010). Crystal structure of a 117 kDa glucansucrase fragment provides insight into evolution and product specificity of GH70 enzymes. Proceedings of the National Academy of Sciences of the United States of America, 107(50), 21406-21411. DOI: 10.1073/pnas.1...