| 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 # | |
| CAS, CS | 2024-03-14 16:20 |
Okinawa | An Approximate Solution Using K-Shortest Path and Reinforcement Learning for a Load Balancing Problem in Communication Networks Himeno Takahashi, Norihiko Shinomiya (Soka Univ.)  CAS2023-123 CS2023-116 |
In recent years, the amount of data traffic in information and communication networks has been increasing and the risk o... [more] | CAS2023-123 CS2023-116 pp.70-73 |
|
| CQ, CBE (Joint) |
2023-01-27 10:15 |
Ibaraki | Epochal Tsukuba International Congress Center (Primary: On-site, Secondary: Online) |
An approximate solution using K-shortest paths for a communication link load balancing problem Himeno Takahashi, Daichi Shimizu, Norihiko Shinomiya (Soka Univ) CQ2022-72 |
In recent years, the amount of data traffic in information and communication networks has been increasing and the risk o... [more] | CQ2022-72 pp.65-68 |
| IBISML | 2022-09-15 15:30 |
Kanagawa | Keio Univ. (Yagami Campus) (Primary: On-site, Secondary: Online) |
An Genenalized LiNGAM when confunder is present
-- A formulation of ICA and the minimum shortest problem -- Joe Suzuki, Tianle Yang (Osaka U.) IBISML2022-39 |
In this study, we investigated a generalization of LiNGAM that allows the presence of confounding. Existing LiNGAMs assu... [more] | IBISML2022-39 pp.47-54 |
| NS | 2022-04-15 11:10 |
Tokyo | kikai shinkou kaikan + online (Primary: On-site, Secondary: Online) |
Service Chaining Based on Capacitated Shortest Path Tour Problem
-- Solution Based on Deep Reinforcement Learning and Graph Neural Network -- Takanori Hara, Masahiro Sasabe (NAIST) NS2022-2 |
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] | NS2022-2 pp.7-12 |
| IN, NS, CS, NV (Joint) |
2021-09-09 12:40 |
Online | Online | Service Chaining Based on Capacitated Shortest Path Tour Problem
-- Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm -- Takanori Hara, Masahiro Sasabe (NAIST) NS2021-60 |
Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional networ... [more] | NS2021-60 pp.18-23 |
| CS | 2020-11-06 10:00 |
Online | Online + Central Community Center, Nonoichi Community Center (Primary: Online, Secondary: On-site) |
ACO-based shortest hop routing algorithm Guan Xin, Hidenori Nakazato (Waseda Univ) CS2020-56 |
ACO (Ant Colony Optimization) routing algorithm is an effective routing algorithm. However, this algorithm has some shor... [more] | CS2020-56 pp.48-53 |
| IA | 2020-10-01 16:25 |
Online | Online | [Poster Presentation]
A Study on Topology Estimation from Observed Network Flows Keita Kitaura, Ryotaro Matsuo (Kwansei Gakuin Univ.), Ryo Nakamura (Fukuoka Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2020-11 |
Acquisition and estimation of topologies of large-scale evolving networks such as communication networks and social net... [more] |
IA2020-11 p.31 |
| NLP | 2020-05-15 13:00 |
Online | Online | A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3 |
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] | NLP2020-3 pp.11-16 |
| NS, IN (Joint) |
2020-03-05 11:00 |
Okinawa | Royal Hotel Okinawa Zanpa-Misaki (Cancelled but technical report was issued) |
Sequential Calculation of Dynamic User Equilibrium for Network Controlled Autonomous Driving Ryo Onoda, Goki Yamamoto, Hiroki Kubokawa, Masaki Murakami, Naoaki Yamanaka, Satoru Okamoto (Keio Univ.) NS2019-194 |
Traffic congestion is a major problem in the automotive society. Because of the spread of autonomous driving vehicles an... [more] | NS2019-194 pp.101-106 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2020-03-06 09:45 |
Fukuoka | Kyushu Institute of Technology (Cancelled but technical report was issued) |
Pose-based Shot Detection in a Badminton Doubles Competition Video Satoru Yamagishi, Yoshiteru Yamamoto, Keisuke Doman, Yoshito Mekada (Chukyo Univ.) IMQ2019-54 IE2019-136 MVE2019-75 |
The movement in formation of players is a key factor to score a point in badminton doubles competition. It is, however,... [more] |
IMQ2019-54 IE2019-136 MVE2019-75 pp.199-203 |
| COMP | 2019-12-13 17:00 |
Gunma | Ikaho Seminar House, Gunma University | COMP2019-42 |
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] | COMP2019-42 pp.93-100 |
| ICSS, IA | 2018-06-26 09:50 |
Ehime | Ehime University | Proposal of Sparse-Modeling based Approach for Betweenness Centrality Estimation Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2018-10 ICSS2018-10 |
In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations u... [more] | IA2018-10 ICSS2018-10 pp.61-66 |
| NLP, CCS | 2018-06-10 11:20 |
Kyoto | Kyoto Terrsa | Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP2018-43 CCS2018-16 |
Computer networks used for high performance computing are often modeled by undirected regular graphs, and the average sh... [more] | NLP2018-43 CCS2018-16 pp.85-90 |
| 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 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 | 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 |
|
| 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 |
| 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 |
[Return to Top Page]