| 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 # | |
| COMP | 2008-09-11 15:20 |
Aichi | Nagoya Inst. of Tech. | 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 |
| COMP | 2008-09-11 16:10 |
Aichi | Nagoya Inst. of Tech. | An analysis of a generalized multi-organization scheduling on unrelated parallel machines Fukuhito Ooshita (Osaka Univ.), Tomoko Izumi, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2008-32 |
We consider the grid where each organization provides a machine and several jobs to be executed. While cooperation of or... [more] | COMP2008-32 pp.63-70 |
| COMP | 2007-06-29 15:30 |
Hokkaido | Hokkaido University | 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 |
| COMP | 2007-03-05 11:15 |
Tokyo | The University of Electro-Communications | Move complexity of gossiping among mobile agents Tomoko Suzuki (Osaka Univ.), Taisuke Izumi (Nagoya Inst. of Tech.), Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
Mobile-agent-based distributed systems are attracting widespread attention as the adaptive and flexible systems: mobi... [more] |
COMP2006-54 pp.29-36 |
| COMP | 2007-03-05 15:55 |
Tokyo | The University of Electro-Communications | 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 |
| CQ, NS, ICM (Joint) |
2006-11-17 12:50 |
Tottori | Tottori Univ. of Environmental Studies | [Encouragement Talk]
A Proposal of Deterministic Decay Bloom Filter in P2P Network and its Evaluation Yusuke Takahashi (Osaka Univ.), Taisuke Izumi (Nagoya Inst. of Tech.), Toshimitsu Masuzawa (Osaka Univ.) NS2006-133 |
A bloom filter is a representation of data item indexes, which achives small memory requirement by allowing one-sided er... [more] | NS2006-133 pp.55-60 |
| NS | 2006-05-18 13:30 |
Kyoto | Kyoto University Clock Tower Centenial Hall | An Improvement of Bloom-Filter-Based Index Dissemination in P2P Networks Yusuke Takahashi, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) NS2006-21 |
A bloom filter is representation of data item indexes, which achives small memory requirement by allowing one-sided er... [more] |
NS2006-21 pp.1-4 |
| COMP | 2005-09-15 16:00 |
Osaka | Osaka Univ., Toyonaka Campus | A Weakly-Adaptive Condition-Based Consensus Algorithm in Asynchronous Distributed Systems Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
While the (uniform) consensus problem is one of fundamental and important problems for designing fault-tolerant distri... [more] |
COMP2005-34 pp.43-48 |
| COMP | 2004-09-17 14:15 |
Hokkaido | Hokkaido University | Synchronous Condition-based Consensus Algorithm Adapting to Input-Vector Legality Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
This paper proposes a novel condition-based algorithm for the uniform consensus in synchronous systems. The proposed a... [more] |
COMP2004-31 pp.41-48 |
[Return to Top Page]