Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CQ, CBE (Joint) |
2022-01-27 16:55 |
Ishikawa |
Kanazawa(Ishikawa Pref.) (Primary: On-site, Secondary: Online) |
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85 |
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] |
CQ2021-85 pp.50-55 |
IA |
2021-09-08 10:55 |
Online |
Online |
Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-17 |
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] |
IA2021-17 pp.14-21 |
IA, SITE, IPSJ-IOT [detail] |
2020-03-03 10:30 |
Online |
Online |
A Study on Efficient Blind Search Utilizing the Rendezvous of Random Walk Agents Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) SITE2019-96 IA2019-74 |
A blind search is a search method for a network, without using topology information of an entire network. While a blind... [more] |
SITE2019-96 IA2019-74 pp.99-104 |
RISING (2nd) |
2019-11-26 10:30 |
Tokyo |
Fukutake Learning Theater, Hongo Campus, Univ. Tokyo |
[Poster Presentation]
Performance evaluation of rendezvous channel method including misdetection by ε-greedy method using learning type occupancy measurement Yuki Nishio, Osamu Takyu (Shinshu Univ.), Hayato Soya (Neko 9 Lab.), Mai Ohta (Fukuoka Univ.), Takeo Fujii (UEC), Fumihito Sasamori, Shiro Handa (Shinshu Univ.) |
The author has so far had a problem that access channels differ between two wireless terminals (master and slave) that e... [more] |
|
SR |
2019-11-04 11:00 |
Overseas |
Rutgers University Inn & Conference Center, NJ, USA |
[Poster Presentation]
Performance evaluation of rendezvous channel by e-greedy method with learning type occupancy under misdetection Yuki Nishio, Osamu Takyu (Shinshu Univ.), Hayato Soya (Neko 9 Lab), Mai Ohta (Fukuoka Univ.), Takeo Fujii (UEC), Fumihito Sasamori, Shiro Handa (Shinshu Univ.) SR2019-65 |
The author has so far had a problem that access channels differ between two
wireless terminals (master and slave) that ... [more] |
SR2019-65 pp.3-4 |
IA |
2019-09-06 10:30 |
Hokkaido |
Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 |
Analysis of Two Random Walks on the Basis of Graph Spectrum
-- The Effect of Degree Heterogeneity on First Meeting Time on a Graph -- Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2019-18 |
The first meeting time is defined as the time required until multiple random walks starting from different nodes in a gr... [more] |
IA2019-18 pp.39-44 |
SR |
2014-05-23 15:00 |
Kanagawa |
Toshiba Education & Training Institute |
Construction of Channel Connection Time Rate for High Speed Learning Assisted Rendezvous Channel Osamu Takyu, Takayuki Yamakita (Shinshu Univ.), Takeo Fujii (UEC), Mai Ohta (Fukuoka Univ.), Fumihito Sasamori, Shiro Handa (Shinshu Univ.) SR2014-19 |
Cognitive Radio, which exploit any available frequency channel, meets the problem of rendezvous channel, where the probl... [more] |
SR2014-19 pp.127-132 |
COMP, IPSJ-AL |
2012-05-14 11:10 |
Ehime |
Ehime University |
Algorithms for partial rendezvous of mobile agents in asynchronous rings Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2012-9 |
In this paper we consider the partial rendezvous of mobile agents in asynchronous rings
, which requires, for a given ... [more] |
COMP2012-9 pp.17-24 |
COMP |
2012-03-16 15:05 |
Tokyo |
Univ. of Tokyo |
Randomized Rendezvous of Multiple Mobile Agents in Anonymous Unidirectional Ring Networks Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2011-53 |
We consider the rendezvous problem of multiple (mobile) agents in anonymous unidirectional ring networks under the const... [more] |
COMP2011-53 pp.45-52 |