Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2019-12-13 09:25 |
Gunma |
Ikaho Seminar House, Gunma University |
A Self-Stabilizing 1-maximal Independent Set Algorithm Hideyuki Tanaka, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.), Ajoy K. Datta (UNLV) COMP2019-30 |
We consider the 1-maximal independent set (1-MIS) problem: given a connected graph $G=(V,E)$, our goal is to find an 1-m... [more] |
COMP2019-30 pp.9-16 |
COMP |
2019-12-13 09:50 |
Gunma |
Ikaho Seminar House, Gunma University |
Self-stabilizing graph exploration by a mobile agent with fast recovery from edge deletions Yuki Hara, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.) COMP2019-31 |
[more] |
COMP2019-31 pp.17-24 |
COMP |
2019-03-18 16:15 |
Tokyo |
The University of Tokyo |
Move-optimal Randomized Partial Gathering of Anonymous Mobile Agents in Anonymous Unidirectional Rings Norikazu Kawata (Osaka Univ.), Masahiro Shibata (KIT), Yuichi Sudo (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-51 |
(To be available after the conference date) [more] |
COMP2018-51 pp.47-54 |
COMP |
2018-12-12 16:15 |
Miyagi |
Tohoku University |
Self-stabilizing exploration of a graph by a mobile agent Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-39 |
The rotor-router is a self-stabilizing algorithm for graph exploration by a mobile agent, that is, it eventually allows,... [more] |
COMP2018-39 pp.47-54 |
COMP |
2018-09-18 13:00 |
Fukuoka |
Kyusyu Institute of Technology |
Mediated population protocols with a base station for line and ring construction Yuumi Yoshikawa, Yuuichi Sudou (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-12 |
A mediated population protocol model is a computational model that abstracts a wireless network composed of numerous low... [more] |
COMP2018-12 pp.23-27 |
COMP, IPSJ-AL |
2018-05-26 15:20 |
Aichi |
Nagoya Institute of Technology |
Convergence Time in Population Protocol Model of Agents with Different Moving Speeds Ryoya Sadano, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-7 |
In this paper, we propose a new population protocol model, which is a computational model of mobile sensor networks, whi... [more] |
COMP2018-7 pp.85-91 |
COMP, IPSJ-AL |
2018-05-26 15:50 |
Aichi |
Nagoya Institute of Technology |
Energy Balancing with Wireless Energy Transmission in Sensor Networks Hiroshi Michizu, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-8 |
In recent years, many people are studying wireless energy transmission technology for transmitting electric energy wirel... [more] |
COMP2018-8 pp.93-100 |
COMP |
2017-10-27 15:20 |
Tokyo |
|
COMP2017-24 |
[more] |
COMP2017-24 pp.29-36 |
COMP |
2017-10-27 15:50 |
Tokyo |
|
Exploration of dynamic tori by mobile agents Tsuyoshi Gotoh, Yuichi Sudo (Osaka Univ), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2017-25 |
Mobile agents (agents) are entities which can move autonomously in a networked system and execute actions at nodes they ... [more] |
COMP2017-25 pp.37-44 |
COMP |
2017-08-18 14:15 |
Aomori |
|
A generalization of the minimal dominating set problem and its self-stabilizing algorithm Hisaki Kobayashi, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2017-16 |
[more] |
COMP2017-16 pp.25-32 |
COMP, ISEC |
2016-12-21 15:10 |
Hiroshima |
Hiroshima University |
A Loosely-Stabilizing Population Protocol for Maximal Independent Set Seiken Kiyosu, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) ISEC2016-78 COMP2016-39 |
Self–stabilizing population protocols are impossible to design for some problems. For example, leader election on ... [more] |
ISEC2016-78 COMP2016-39 pp.43-49 |
COMP |
2016-04-22 10:50 |
Nara |
|
Move-Efficient Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents Tsuyoshi Goto, Masahiro Shibata (Osaka Univ.), Fukuhito Oosita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
[more] |
|
COMP |
2016-04-22 11:20 |
Nara |
|
A Local Distributed Algorithm for the Connected Spanning Subgraph Problem with Smaller Number of Edges Hisaki Kobayashi, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2016-2 |
[more] |
COMP2016-2 pp.9-13 |
COMP, IPSJ-AL |
2015-06-13 11:05 |
Hokkaido |
|
An Algorithm for Uniform Deployment of Mobile agents in Asynchronous Rings Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2015-11 |
In this paper, we consider the uniform deployment problem of mobile agents in asynchronous unidirectional ring
networks... [more] |
COMP2015-11 pp.107-114 |
COMP |
2014-09-02 17:00 |
Aichi |
Toyohashi University of Technology |
Algorithms for Group Gossiping of Mobile Agents Jun Ri, Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2014-24 |
We introduce a concept of agent groups and formulate the group gossiping problem. An (agent) group is a set of agents th... [more] |
COMP2014-24 pp.61-68 |
COMP |
2014-04-24 13:10 |
Miyagi |
Tohoku University |
A Memory-efficient Self-stabilizing Algorithm for Constructing Chordal Rings Rumi Ito, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2014-3 |
[more] |
COMP2014-3 pp.13-20 |
COMP |
2014-03-10 15:05 |
Tokyo |
|
Safely-converging self-organization of a BFS tree with many leaves in virtual grid networks Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2013-70 |
We propose a safely-converging self-organization of a Breadth-First-Search spanning tree (BFS tree) with many leaves in ... [more] |
COMP2013-70 pp.69-76 |
COMP, IPSJ-AL |
2012-05-14 10:35 |
Ehime |
Ehime University |
Algorithms for Uniform Deployment of Mobile Agents on Synchronous Rings Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2012-8 |
In this report, we consider uniform deployment algorithms for mobile agents, which guarantee that allagents are spread u... [more] |
COMP2012-8 pp.9-16 |
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 |