|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
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 |
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 |
CQ |
2020-09-03 11:45 |
Osaka |
Osaka University Nakanoshima Center (Primary: On-site, Secondary: Online) |
Study on the Effectivity of Rendezvous Search Using Random Walk in Large-Scale Unknown Networks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Univ.) CQ2020-37 |
Many studies proposed a rendezvous search method that multiple searchers starting from different nodes on a network try ... [more] |
CQ2020-37 pp.15-20 |
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 |
IA |
2019-11-14 15:30 |
Tokyo |
Kwansei Gakuin University, Tokyo Marunouchi Campus (Sapia Tower) |
[Poster Presentation]
Investigation on the First Meeting Time of Random Walk Agents with Heterogeneous Transition Probability for Optimal Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Gakuin Univ.) IA2019-31 |
In an unstructured network~(e.g., unstructured P2P network, social
network, and MANET), there is a restriction that eac... [more] |
IA2019-31 pp.43-46 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|