IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 27  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2021-10-23
14:30
Online Online Algorithms for Graph Class Identification Problems in the Population Protocol Model
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2021-17
In this paper, we focus on graph class identification problems in the population protocol model.
A graph class identifi... [more]
COMP2021-17
pp.20-27
COMP, IPSJ-AL 2020-09-02
10:30
Online Online Uniform Bipartition in Population Protocol Model over Arbitrary Communication Networks
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST), Sebastien Tixeuil (Sorbonne Universite) COMP2020-8
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide... [more] COMP2020-8
pp.17-24
COMP, IPSJ-AL 2020-05-09
16:15
Online Online Gathering for mobile agents with a strong team in weakly Byzantine environments
Jion Hirose, Masashi Tsuchida (NAIST), Junya Nakamura (TUT), Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2020-2
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The t... [more] COMP2020-2
pp.9-16
COMP, IPSJ-AL 2019-05-11
15:10
Kumamoto Kumamoto University Ring Exploration Algorithms for Myopic Luminous Robots with Larger Visibility
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2019-7
In this paper, we investigate ring exploration algorithms for autonomous mobile robots. The robots are myopic, that is, ... [more] COMP2019-7
pp.83-90
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-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
14:00
Aichi Nagoya Institute of Technology Obstruction detection by asynchronous opaque robots using lights
Adam Heriban, Michiko Inoue, Fukuhito Ooshita (NAIST), Sebastien Tixeuil (Sorbonne Universite) COMP2018-5
 [more] COMP2018-5
pp.71-78
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
SS, DC 2017-10-20
10:00
Kochi Kochi City Culture-plaza CUL-PORT Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks
Michiko Inoue, Fukuhito Ooshita (NAIST), Sebastien Tixeuil (UPMC) SS2017-31 DC2017-30
We present a new self-stabilizing 1-maximal matching algorithm that works under the distributed unfair daemon for arbitr... [more] SS2017-31 DC2017-30
pp.61-66
COMP 2016-09-06
11:00
Toyama Toyama Prefectural University Gathering of mobile agents in Byzantine environments with authenticated whiteboards
Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2016-15
We propose an algorithm for the gathering problem of mobile agents in Byzantine environments. The proposed algorithm can... [more] COMP2016-15
pp.7-14
COMP 2015-09-01
14:00
Nagano   A Silent Anonymous Self-Stabilizing Algorithm to Construct 1-Maximal Matching under the Distributed Daemon in Trees
Yuma Asada, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2015-20
We propose a silent self-stabilizing 1-maximal matching algorithm for anonymous trees under a distributed unfair daemon.... [more] COMP2015-20
pp.27-34
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
COMP 2010-03-12
16:25
Tokyo National Institute of Informatics Time and Space Efficient Graph Exploration by a Mobile Agent Using Whiteboard
Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2009-58
We consider the exploration problem with a single agent in undirected graphs. Starting from an arbitrary node, the agent... [more] COMP2009-58
pp.57-64
 Results 1 - 20 of 27  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan