| 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 # | |
| CNR, IN, MoNA (Joint) [detail] |
2017-11-16 10:50 |
Fukuoka | Coverage Expansion of Vehicular Millimeter Wave Communication with Multi-hop Relaying Akihito Taya, Takayuki Nishio, Masahiro Morikura, Koji Yamamoto (Kyoto Univ.)  MoNA2017-17 |
A small road side unit (RSU) coverage of millimeter wave (mmWave) communications for autonomous vehicles is an open issu... [more] | MoNA2017-17 pp.13-18 |
|
| NS, IN (Joint) |
2017-03-03 15:30 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL | Selection Algorithm of Links to Aggregate Traffic for Network Greening with considering Transmission Performance Atsushi Yorichika, Kenji Kawahara (KIT) IN2016-162 |
As the Internet grows explosively and network components such as routers and switches increase, they consume electric po... [more] | IN2016-162 pp.389-394 |
| NS, IN (Joint) |
2017-03-03 13:20 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL | On Path Selection Considering Length and Reliability for Automatic Evacuation Guiding Based on Interactions between Evacuees and Their Mobile Nodes Takanori Hara, Masahiro Sasabe, Shoji Kasahara (NAIST) NS2016-247 |
When disasters occur, evacuees have to evacuate to safe place quickly. To tackle this problem, there has been proposed a... [more] | NS2016-247 pp.517-522 |
| COMP, ISEC | 2016-12-21 15:30 |
Hiroshima | Hiroshima University | Theoretical Model of Interconnection Networks Consisting of Hosts and Switches Ryota Yasudo (Keio Univ.), Michihiro Koibuchi (NII), Hideharu Amano (Keio Univ.), Koji Nakano (Hiroshima Univ.) ISEC2016-79 COMP2016-40 |
Designing interconnection networks with low average shortest path length (ASPL) is an important object for researchers o... [more] | ISEC2016-79 COMP2016-40 pp.51-58 |
| IA | 2016-11-03 14:10 |
Overseas | Taipei (Taiwan) | Performance Comparison of Shortest-Path Routing and Detour Routing for Content-Centric Networking Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2016-28 |
In this paper, we quantitatively investigate the optimality of the shortest-path routing in CCN (Content-Centric Networ... [more] |
IA2016-28 pp.13-18 |
| COMP | 2016-10-21 14:30 |
Miyagi | Tohoku University | On lower bounds for the complexity of the Frobenius problem and its subproblems Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-28 |
In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive in... [more] | COMP2016-28 pp.35-37 |
| COMP | 2015-12-01 10:30 |
Osaka | A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] | COMP2015-31 pp.9-16 |
|
| IN | 2015-01-23 16:10 |
Aichi | Nagoya International Center | Link Selection Scheme based on Shortest Path Trees from Exporter Routers with considering Traffic Fluctuation for Network Greening Tomohiro Sakamoto, Kenji Kawahara, Yuji Oie (KIT) IN2014-117 |
As the Internet grows explosively and network components such as routers and switches increase,they consume electric pow... [more] | IN2014-117 pp.113-118 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 15:35 |
Oita | B-ConPlaza | Parallelization of Shortest Path Search on Various Platforms and Its Evaluation Shuto Kurebayashi, Shinya Takamaeda, Jun Yao, Yasuhiko Nakashima (NAIST) CPSY2014-74 |
Since graph processing has irregular control flows and memory access patterns, its acceleration by the parallelization i... [more] | CPSY2014-74 pp.13-18 |
| NLP, CAS | 2014-10-17 09:20 |
Ehime | Ehime University | Evaluating availability and Solving Shortest Path Problems by Adaptable Independent-minded Particle Swarm Optimization Yoko Ishii, Haruna Matsushita (Kagawa Univ.) CAS2014-70 NLP2014-64 |
The Shortest-Path Problem (SPP) is one of the most fundamental problems in graph theory. We proposed to investigate on t... [more] | CAS2014-70 NLP2014-64 pp.95-98 |
| COMP | 2014-09-02 16:30 |
Aichi | Toyohashi University of Technology | Parallel Algorithm for Determining Shortest Paths in DAG Masahiro Migita, Masashi Toda (Kumamoto Univ.) COMP2014-23 |
In this paper, we propose an efficient parallel algorithm for determining shortest paths in a DAG(Directed Acyclic Graph... [more] | COMP2014-23 pp.55-59 |
| RECONF | 2014-06-12 16:25 |
Miyagi | Katahira Sakura Hall | Design of an FPGA-Based Accelerator for Shortest-Path Search over Large-Scale Graphs Yasuhiro Takei, Masanori Hariyama, Michitaka Kameyama (Tohoku Univ.) RECONF2014-15 |
Shortest-path search over large scale graphs plays an important role in various applications. However, shortest path alg... [more] | RECONF2014-15 pp.79-83 |
| NS, IN (Joint) |
2014-03-06 11:00 |
Miyazaki | Miyazaki Seagia | Dynamic Resource Allocation Based on Amount of Traffic in Virtual Networks Yuki Koyanagi, Takuji Tachibana (Univ. of Fukui) IN2013-148 |
In this paper， we propose a dynamic resource allocation for virtual service resources and network resources for the tra... [more] |
IN2013-148 pp.29-34 |
| NS, IN (Joint) |
2014-03-06 11:40 |
Miyazaki | Miyazaki Seagia | Virtual Network Reconstruction for Maintaining Robustness of Physical Network and Rapid Topology Changing Yasuhiro Urayama, Takuji Tachibana (Univ. of Fukui) NS2013-184 |
In this paper, we propose a new virtual network construction for maintaining the robustness of a physical network and ch... [more] | NS2013-184 pp.43-48 |
| COMP | 2013-12-21 09:30 |
Okinawa | Okinawa Industry Support Center | An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon Matsuo Konagaya, Tetsuo Asano (JAIST), Otfried Cheong (KAIST), Sang Won Bae (Kyonggi Univ.) COMP2013-48 |
Given a simple polygon with $n$ vertices in a plane, we compute the shortest path between two query points using less ... [more] |
COMP2013-48 pp.59-62 |
| NLP | 2013-10-29 16:45 |
Kagawa | Sanport Hall Takamatsu | Solving Shortest Path Problems of Complex Networks Using Adaptable Independent-minded Particle Swarm Optimization Yoko Ishii, Haruna Matsushita (Kagawa Univ.) NLP2013-109 |
The Shortest Path Problem (SPP) is one of the most fundamental problems in graph theory. The purpose of this study is to... [more] | NLP2013-109 pp.211-214 |
| COMP | 2013-06-24 10:35 |
Nara | Nara Women's University | Shortest Path Queries by Labeling for Paths with Pruning in Road Networks Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-20 |
Shortest-Path problem is a fundamental problem in road networks and a lot of methods are proposed. In the labeling appro... [more] | COMP2013-20 pp.7-15 |
| NS | 2013-04-19 14:20 |
Ishikawa | The Wajima Chamber of Commerce and Industry | Optimal Multiple Shared Multicast Trees for Many-to-Many Multicasting Communication Shanming Zhang, Hidetoshi Takeshita (Keio Univ.), Takashi Kurimoto (NTT), Satoru Okamoto, Naoaki Yamanaka (Keio Univ.) NS2013-10 |
Multicast, which provides an efficient way of disseminating data from a source to all the members in a multicast group, ... [more] | NS2013-10 pp.49-54 |
| NLP | 2013-03-15 10:40 |
Chiba | Nishi-Chiba campus, Chiba Univ. | Response of an External Force in the Network Optimization Method Mimicking the True Slime Mold Naohiro Takagi, Kuniyasu Shimizu (Chiba Inst. of Tech.) NLP2012-164 |
In this study, we apply an external trapezoid force to the shortest path finding method mimicking the true slime mold, a... [more] | NLP2012-164 pp.103-107 |
| PN | 2013-03-12 13:20 |
Okinawa | Okinawa-ken Seinen-Kaikan | Implementation of Link-Load Ranking Scheme in OSPF-TE Networks Nattapong Kitsuwan, Eiji Oki (Univ. of Electro- Comm.) PN2012-87 |
This paper shows an implementation of our link-load ranking (LLR) scheme for open shortest path first traffic engineer (... [more] | PN2012-87 pp.53-58 |
[Return to Top Page]