Loading...
Search for:
tree-data-structures
0.008 seconds
On some combinatorial properties of meshes
, Article Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, Hong Kong, 10 May 2004 through 12 May 2004 ; 2004 , Pages 117-122 ; Sharif University of Technology
2004
Abstract
The mesh structure has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this paper, we investigate some topological properties of meshes. In particular, we study the problem of finding the number of nodes located at a given distance from a given node (surface area) and the number of nodes located within a given distance from a given node (volume), and have derived some expressions calculating these numbers
Optimal strategy for walking in streets with minimum number of turns for a simple robot
, Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 8881, issue , 2014 , p. 101-112 ; Ghodsi, M ; Sharif University of Technology
Abstract
We consider the problem of walking a simple robot in an unknown street. The robot that cannot infer any geometric properties of the street traverses the environment to reach a target t, starting from a point s. The robot has a minimal sensing capability that can only report the discontinuities in the depth information (gaps), and location of the target point once it enters in its visibility region. Also, the robot can only move towards the gaps while moving along straight lines is cheap, but rotation is expensive for the robot. We maintain the location of some gaps in a tree data structure of constant size. The tree is dynamically updated during the movement. Using the data structure, we...