| 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 | 2023-12-22 16:00 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Uniform deployment of mobile robots with restricted views in path graphs Kazuki Hasegawa, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)  COMP2023-26 |
We consider the uniform deployment of mobile robots on path graphs.The view each robot can observe is restricted in the ... [more] | COMP2023-26 pp.61-67 |
| COMP | 2023-10-24 16:20 |
Aichi | Nagoya Univ. Venture Business Lab. | Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] | COMP2023-14 pp.13-20 |
| COMP, IPSJ-AL | 2023-05-11 15:25 |
Hokkaido | Hokkaido University | Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6 |
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] | COMP2023-6 pp.29-35 |
| COMP | 2022-12-06 15:00 |
Ehime | Ehime Univ. Media Hall | A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) COMP2022-28 |
Let $G$ be any weighted undirected graph of $n$ vertices and $m$ edges, and $s$ be an arbitrary source vertex in $G$. In... [more] | COMP2022-28 pp.32-39 |
| COMP, IPSJ-AL | 2022-05-20 14:10 |
Online | Online | Computational Power of A Memoryless Mobile Agent in Undirected Rings Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2022-8 |
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] | COMP2022-8 pp.46-53 |
| RCC, ASN, RCS, NS, SR (Joint) |
2015-07-30 10:30 |
Nagano | JA Naganoken Bldg. | [Poster Presentation]
Study of Reducing Delay in Wireless Sensor Networks Using Data Aggregation Naoki Kitamura, Kouichi Mutsuura, Shiro Handa, Osamu Takyu, Fumihito Sasamori (Shinshu Univ.) RCC2015-30 NS2015-50 RCS2015-113 SR2015-31 ASN2015-40 |
In wireless sensor networks, to suppress power consumption is an important issue. Usually, when a router relays the data... [more] | RCC2015-30 NS2015-50 RCS2015-113 SR2015-31 ASN2015-40 pp.75-76(RCC), pp.79-80(NS), pp.77-78(RCS), pp.93-94(SR), pp.115-116(ASN) |
| ASN | 2015-05-14 16:20 |
Tokyo | Tokyo Denki University | Study of Power Consumption and Delay by Data Aggregation in Wireless Sensor Networks Naoki Kitamura, Kouichi Mutsuura, Shiro Handa, Osamu Takyu, Fumihito Sasamori (Shinshu Univ.) ASN2015-9 |
In wireless sensor networks, to suppress power consumption is an important issue. Usually, when a router relays the data... [more] | ASN2015-9 pp.47-52 |
| AP | 2005-01-20 11:20 |
Saga | Saga University | Circularly polarized reconfigurable patch antenna using Y-branched feeding structure Naoki Kitamura, Takeshi Fukusako, Nagahisa Mita (Kumamoto Univ.) |
[more] | AP2004-200 pp.25-30 |
[Return to Top Page]