Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MVE, IPSJ-CVIM, VRSJ-SIG-MR |
2023-01-27 16:55 |
Nara |
Nara Institute of Science and Technology (Nara, Online) (Primary: On-site, Secondary: Online) |
[Short Paper]
SPIDER-Pad; Tablet-mounted Haptic Device Using Thread Tension on a Finger Wataru Tazuke, Koichi Wada (Ritsumeikan Univ.), Yuki Tajima (KDDI Research, inc.), Fumihisa Shibata, Asako Kimura (Ritsumeikan Univ.) MVE2022-46 |
(To be available after the conference date) [more] |
MVE2022-46 pp.66-67 |
COMP, IPSJ-AL |
2022-05-20 14:45 |
Online |
Online (Online) |
Energy-Constrained Autonomous Mobile Robots: Computational Power and Cross-Model Analysis Kevin Buchin (TU Dort.), Paola Flocchini (Univ. of Ottawa), Irina Kostitsyna, Tom Peters (TU Eind.), Nicola Santoro (Carleton Univ.), Koichi Wada (Hosei Univ.) COMP2022-9 |
We consider distributed systems of identical autonomous computational entities, called
robots, moving and operating i... [more] |
COMP2022-9 pp.54-61 |
COMP, IPSJ-AL |
2020-05-09 17:26 |
Online |
Online (Online) |
On Memory, Communication, and Synchronous Schedulers for Autonomous Mobile Robots Paola Flocchini (UoO), Nicola Santoro (CU), Koichi Wada (HU) COMP2020-3 |
We investigate the computational power of distributed systems whose autonomous computational entities, called robot... [more] |
COMP2020-3 pp.17-24 |
COMP |
2016-04-22 13:30 |
Nara |
(Nara) |
Gathering Algorithm for Distributed Mobile Robots with Lights Satoshi Terai (Hosei Univ.), Koichi Wada (Hosei Univ), Yoshiaki Katayama (NIT) COMP2016-3 |
We study a gathering problem for n robots that move on a two dimensional plane. Robots are autonomous, anonymous, and ha... [more] |
COMP2016-3 pp.15-22 |
COMP |
2015-03-09 09:40 |
Kyoto |
Ritsumeikan University (Kyoto) |
On a Gathering Problem for Large size Fat Robots in a Grid Yoshinobu Ito, Yoshiaki Katayama (NIT), Koichi Wada (Hosei) COMP2014-42 |
[more] |
COMP2014-42 pp.1-8 |
COMP |
2014-12-05 14:55 |
Kumamoto |
Sojo University (Kumamoto) |
On a Gathering Protocol for Five Fat Robots Takuya Hirano, Yoshiaki Katayama (NITech), Koichi Wada (HOSEI Univ.) COMP2014-37 |
In this paper, we propose a protocol for gathering problem with five mobile fat robots. Robots are anonymous, have no co... [more] |
COMP2014-37 pp.29-36 |
COMP, IPSJ-AL |
2014-06-13 16:55 |
Ehime |
Matsuyama, Ehime (Ehime) |
A Gathering Problem for Mobile Fat Robots in a Grid without the Global Coodinate System Yoshinobu Ito, Yoshiaki Katayama (Nagoya Inst. of Tech.), Koichi Wada (hosei Univ.) COMP2014-10 |
[more] |
COMP2014-10 pp.53-59 |
COMP |
2014-03-10 13:20 |
Tokyo |
(Tokyo) |
[Fellow Memorial Lecture]
VLSI design and Big data - When quantities change quality Koichi Wada (Hosei U) COMP2013-67 |
The quantity of Big Data changes its quality and/or has to change its essential part. This situation has occurred in VLS... [more] |
COMP2013-67 p.51 |
COMP, IPSJ-AL |
2013-05-18 15:30 |
Hokkaido |
Otaru University of Commerce (Hokkaido) |
On parallel complexity of MapReduce computation Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-17 |
[more] |
COMP2013-17 pp.143-147 |
COMP, IPSJ-AL |
2011-09-06 11:15 |
Hokkaido |
Hakodate City Central Library (Hokkaido) |
On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech) COMP2011-23 |
Geocasting is a mechanism to deliver messages of interest to all hosts within a given geographical region. GeoTORA is on... [more] |
COMP2011-23 pp.23-30 |
COMP |
2011-03-09 10:35 |
Tokyo |
Chuo Univ. (Tokyo) |
Communication-Efficient Broadcast on Markovian Evolving Graphs Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT) COMP2010-48 |
The design of efficient distributed algorithms working on dynamic networks
recently receives much attention. The Marko... [more] |
COMP2010-48 pp.9-15 |
COMP |
2008-09-11 14:20 |
Aichi |
Nagoya Inst. of Tech. (Aichi) |
Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-29 |
(To be available after the conference date) [more] |
COMP2008-29 pp.39-46 |
COMP |
2008-09-11 14:50 |
Aichi |
Nagoya Inst. of Tech. (Aichi) |
On Gathering Problem in a Ring for 2n Autonomous Mobile Robots Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-30 |
This paper studies a gathering problem in a ring for $2n$ autonomous mobile robots. In [1] it is shown that gathering is... [more] |
COMP2008-30 pp.47-54 |
COMP |
2008-09-11 15:20 |
Aichi |
Nagoya Inst. of Tech. (Aichi) |
On Circle Formation by Four Autonomous Mobile Robots Keita Hashimoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-31 |
We consider a problem to make $n$ asynchronous autonomous mobile robots to form a regular $n$-gon.
This problem is call... [more] |
COMP2008-31 pp.55-62 |
AI, IPSJ-ICS |
2008-03-06 11:20 |
Hokkaido |
(Hokkaido) |
The Relevance Between the Disaster Relief Simulation and the Feature About Buildings and Roads Hiroaki Kohketsu (Nitech), Nobuhiro Ito (Aitech), Kazunori Iwata (Aichi Univ.), Koichi Wada (Nitech) AI2007-54 |
In a research area of agents, it is a problem to get a method which evaluates the behavior of agents or multi agent syst... [more] |
AI2007-54 pp.61-66 |
COMP |
2007-06-29 15:30 |
Hokkaido |
Hokkaido University (Hokkaido) |
A Difference-Optimal Algorithm for Gathering Autonomous Mobile Robots with Dynamic Compasses Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (Nagoya Inst.of Tech.) COMP2007-27 |
Let us consider $n$ autonomous mobile robots that
can move in a two dimensional plane. The gathering problem is
one ... [more] |
COMP2007-27 pp.71-78 |
MoNA, IPSJ-MBL |
2007-05-18 12:40 |
Okinawa |
Okinawa-seinen-kaikan (Okinawa) |
Ad-hoc Network Routing Method on Self-Stabilizing Clustering Motonari Kobayashi, Masanori Morita (NTT DoCoMo, Inc.), Naohisa Takahashi, Yoshiaki Katayama, Koichi Wada (Nagoya Institute of Technology) MoMuC2007-21 |
In ad-hoc networks, when there are large number of nodes, a large amount of control signal flood and consume a lot of co... [more] |
MoMuC2007-21 pp.107-112 |
COMP |
2007-03-05 15:55 |
Tokyo |
The University of Electro-Communications (Tokyo) |
A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission Taisuke Izumi, Koichi Wada (Nagoya Inst. of Tech.) |
The (uniform) consensus, which is one of fundamental and important
problems for designing fault-tolerant distributed sy... [more] |
COMP2006-58 pp.59-66 |
COMP |
2006-12-04 14:50 |
Aichi |
Nagoya University (Aichi) |
A Gathering Problem for autonomous mobile robots with disagreement in time varying compasses Yuichi Tomida (NIT), Hiroyuki Imazu (AISIN AW), Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) |
[more] |
COMP2006-45 pp.29-36 |
COMP |
2006-12-04 15:20 |
Aichi |
Nagoya University (Aichi) |
A Self-Stabilizing Protocol for k-hop Clustering with Solid-discs On Sensor Networks Shingo Omura, Naoki Inaba, Yoshiaki Katayama, Koichi Wada (Nagoya Instit. of Tech.) |
[more] |
COMP2006-46 pp.37-44 |