| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IN, IA (Joint) |
2022-12-13 11:30 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
For Understanding the First Meeting Time of Multiple Random Walks with Different Transition Probabilities Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Osaki (Kwansei Gakuin Univ.)  IA2022-59 |
Random walks on graphs have been used in various graph algorithms, and its understanding is important to design an effic... [more] | IA2022-59 pp.60-63 |
| IN, IA (Joint) |
2022-12-13 11:45 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
On the Study of the Effectiveness of the Random Walk-Based Rendezvous for Real Social Networks Toma Yoshinari, Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-60 |
Rendezvous searches on networks discuss the meeting of multiple searchers existing on different nodes. Especially, a bli... [more] | IA2022-60 pp.64-66 |
| 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 |
| CQ, CBE (Joint) |
2022-01-28 11:45 |
Ishikawa | Kanazawa（Ishikawa Pref.） (Primary: On-site, Secondary: Online) |
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ2021-92 |
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] | CQ2021-92 pp.88-93 |
| 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 |
| CS, CQ (Joint) |
2021-05-14 10:50 |
Online | On-line | A Study of the Effect of Agents' Diversities on the Running Time of the Random Walk-Based Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Univ.) CQ2021-13 |
A rendezvous search, which aims to efficiently meet multiple searchers existing different nodes on a network, is expecte... [more] | CQ2021-13 pp.53-58 |
| 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 |
| 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 |
[Return to Top Page]