Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Tiko Kameda"'
Publikováno v:
IEEE Transactions on Robotics. 22:446-460
Polygon search is the problem of finding mobile intruders who move unpredictably in a polygonal region. In this paper, we consider a special case of this problem, called boundary search, where the searcher is allowed to move only along the boundary o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae704d5de7cab2a383351f23f8758c25
https://doi.org/10.1109/tro.2006.870640
https://doi.org/10.1109/tro.2006.870640
Publikováno v:
Information Processing Letters. 92:1-8
We study the problem of searching for mobile intruders in a polygonal region by stationary searchers having various levels of vision given by the number of flashlights that a searcher carries. We show that (2g - 1) 1-searchers (i.e., 2g - 1 searchers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b39228ea57bd0fbd2295d8de8ba433a0
https://doi.org/10.1016/j.ipl.2004.06.010
https://doi.org/10.1016/j.ipl.2004.06.010
Publikováno v:
Algorithmica. 34:240-260
Given a graph G=(V,E) and a set of vertices M ⊆ V, a vertex v ∈ V is said to be controlled by M if the majority of v’s neighbors (including itself) belong to M. M is called a monopoly in G if every vertex v∈ V is controlled by M. For a specif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee3de59dc2c7b39729c55eebb44ed562
https://doi.org/10.1007/s00453-002-0963-8
https://doi.org/10.1007/s00453-002-0963-8
Publikováno v:
International Journal of Computational Geometry & Applications. 11:529-553
Polygon search is the problem of finding mobile intruders who move unpredictably in a polygonal region, using one or more mobile searchers. Different levels of vision are assumed to model the ability of the searchers. In this paper we mainly consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a15759bd42d9b170abddc5c4f88c8e3a
https://doi.org/10.1142/s0218195901000638
https://doi.org/10.1142/s0218195901000638
Autor:
Kazuhisa Makino, Tiko Kameda
Publikováno v:
SIAM Journal on Discrete Mathematics. 14:381-407
A coterie under an underlying set U is a family of subsets of U such that every pair of subsets has at least one element in common, but neither is a subset of the other. A coterie C under U is said to be nondominated (ND) if there is no other coterie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4e4f004a3080755ba8e91997cb5c7ce
https://doi.org/10.1137/s0895480100371110
https://doi.org/10.1137/s0895480100371110
Publikováno v:
SIAM Journal on Discrete Mathematics. 13:227-254
Let G be an undirected graph with a set of vertices V and a set of edges E. Given an integer r, we assign at most r labels (representing "resources") to each vertex. We say that such an assignment is an r-configuration if, for each label c, the verti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96ea46a4f20f73e1c50b6456a5a44772
https://doi.org/10.1137/s0895480196311328
https://doi.org/10.1137/s0895480196311328
Autor:
Masafumi Yamashita, Tiko Kameda
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 10:878-887
In the networks considered in this paper, processors do not have distinct identity numbers. On such a network, we discuss the leader election problem and the problem of counting the number of processors having the same identity number. As the communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5957e7aa8f9477892926d756539fe1f5
https://doi.org/10.1109/71.798313
https://doi.org/10.1109/71.798313
Publikováno v:
Journal of the ACM. 45:215-245
We consider the problem faced by a robot that must explore and learn an unknown room with obstacles in it. We seek algorithms that achieve a bounded ratio of the worst-case distance traversed in order to see all visible points of the environment (thu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c41a473a2717973eacd97355e2aa910f
https://doi.org/10.1145/274787.274788
https://doi.org/10.1145/274787.274788
Autor:
Tiko Kameda, Hiroshi Nagamochi
Publikováno v:
Journal of the Operations Research Society of Japan. 39:135-158
The construction of a cactus representation for all minimum cuts in an edge-weighted) undirected network is studied in this pa,per. Given such a network with a set V of vertices and a set E of edges, the previously known algorithms for constructing a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d3bf63d129ef7f9b1c328982bf3de67
https://doi.org/10.15807/jorsj.39.135
https://doi.org/10.15807/jorsj.39.135
Autor:
Masafumi Yamashita, Tiko Kameda
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 7:90-96
For pt I see ibid. In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different condit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9ba82edb393c0507653e0a8cb7b7aa0
https://doi.org/10.1109/71.481600
https://doi.org/10.1109/71.481600