Search for Author All Reviews
	Yamashita, Masafumi     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Plane formation by synchronous mobile robots in the three-dimensional Euclidean space Yamauchi Y., Uehara T., Kijima S., Yamashita M. Journal of the ACM 64(3): 1-43, 2017.  Type: Article This is an interesting and thorough investigation of the plane formation problem. This problem addresses how a large group of robots moving in 3D Euclidean space--that can see but have no identification, no access to a common ...... Feb 16 2018     Fair Petri nets and structural induction for rings of processes Li J., Suzuki I., Yamashita M. Theoretical Computer Science 135(2): 377-404, 1994.  Type: Article Whether all concurrent processing systems constructed from copies of a given finite state machine have a certain property is generally undecidable, even if only a simple rule for connecting the components is used. In this paper, the au...... Oct 1 1996     Searching for a mobile intruder in a polygonal region Suzuki I., Yamashita M. SIAM Journal on Computing 21(5): 863-888, 1992.  Type: Article Special cases of the following interesting question are considered. Suppose a man is lost and wandering unpredictably in a dark cave. A party of searchers who know the structure of the cave is to be sent to find him. What is the minimu...... Jul 1 1993     The searchlight scheduling problem Sugihara K., Suzuki I., Yamashita M. SIAM Journal on Computing 19(6): 1024-1040, 2000.  Type: Article Imagine a thief is loose in a dark polygon. The polygon contains a number of “searchlights,” points that can shine a beam of light in any one direction. The novel problem introduced in this paper is to design a sche...... Jan 1 1992     Parallel and sequential transformations on digital images Yamashita M. Pattern Recognition 18(1): 31-41, 1985.  Type: Article This paper presents some interesting results about the nature of sequential and parallel algorithms based on fixed neighborhoods. The exact type of algorithms investigated is one which invokes the same subroutine at each pixel, conside...... Apr 1 1986
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy