| 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 # | |
| NC, MBE (Joint) |
2023-03-14 09:55 |
Tokyo | The Univ. of Electro-Communications (Primary: On-site, Secondary: Online) |
An extension of the Sinkhorn divergence via convex combination of the bias correction term Kyohei Miwa, Yu Nishiyama (UEC)  NC2022-100 |
Sinkhorn divergence (SD) is a divergence in which a bias correction term is added to the entropic optimal transport (EOT... [more] | NC2022-100 pp.48-53 |
| IN, NS (Joint) |
2023-03-02 11:00 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Resource allocation methods for efficient and fairness utilization of network and computational resources in edge cloud
-- Scalable resource allocation and network path selection -- Shota Akiyoshi (Kyutech), Yuzo Taenaka (NAIST), Kazuya Tsukamoto (Kyutech) NS2022-170 |
Cross-domain data fusion in the edge cloud is becoming a key driver to growth of the numerous and diverse applications i... [more] | NS2022-170 pp.19-24 |
| R | 2021-12-04 16:00 |
Online | Online | Condition-based Maintenance Policy for a Linear Consecutive-k-out-of-n: G System Lei Zhou (Yamaguchi Univ.), Hisashi Yamamoto, Xiao Xiao (Tokyo Met. Univ.) R2021-41 |
A linear consecutive-$k$-out-of-$n$:G system consists of $n$ components which are arranged in a line and the system work... [more] | R2021-41 pp.13-18 |
| HWS | 2021-04-12 10:25 |
Tokyo | Tokyo University/Online (Primary: On-site, Secondary: Online) |
Approximate Solution of Large-Scale Job Shop Scheduling Problem and Its Application to Hardware Cryptographic Design Kento Ikeda, Makoto Ikeda (Tokyo Univ.) HWS2021-2 |
The optimal design of cryptographic data paths in hardware can be considered as a job-shop scheduling problem. This prob... [more] | HWS2021-2 pp.7-12 |
| 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 |
| DC, SS | 2019-10-24 14:30 |
Kumamoto | Kumamoto Univ. | Computing Optimal Weight in Weighted Register Automata and Related Decision Problems Reo Yoshimura (Nagoya Univ.), Yoshiaki Takata (Kochi-tech.), Hiroyuki Seki (Nagoya Univ.) SS2019-16 DC2019-44 |
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] | SS2019-16 DC2019-44 pp.19-24 |
| MSS, SS | 2019-01-16 09:00 |
Okinawa | Optimal Run Problem for Weighted Register Automata Reo Yoshimura, Hiroyuki Seki (Nagoya Univ.) MSS2018-66 SS2018-37 |
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] | MSS2018-66 SS2018-37 pp.61-66 |
|
| R | 2018-07-27 14:25 |
Hokkaido | Search process for multi-objective network by applying efficiency of path search in one-objective network Natsumi Takahashi, Shao-Chin Sung (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2018-12 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] | R2018-12 pp.7-12 |
|
| R | 2018-05-25 16:20 |
Aichi | Aichi Institute of Technology, Motoyama Campus | Search Space Restriction by Spanning Tree in Multi-Objective Network Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2018-6 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] | R2018-6 pp.31-36 |
| R | 2017-10-20 16:20 |
Kumamoto | Search for Optimal Construction Network with Multi-Objective Functions Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2017-49 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] | R2017-49 pp.29-33 |
|
| IE, IMQ, MVE, CQ (Joint) [detail] |
2016-03-07 13:15 |
Okinawa | QoS Evaluations of Smart Route Navigation for Efficient Wireless Resource Usage with Multiple Mobile Users Kenji Kanai, Sakiko Takenaka, Jiro Katto (Waseda Univ.), Tutomu Murase (Nagoya Univ.) CQ2015-120 |
In order to deal with mobile traffic explosion, an efficient wireless resource usage is mandatory. A mobile user can sel... [more] | CQ2015-120 pp.73-78 |
|
| MBE, NC (Joint) |
2015-11-21 10:00 |
Miyagi | Tohoku University | Obstacle-Avoiding Strategy in Human Three-Joint Arm's Reaching Movement Mechanism Toshikazu Matsui, Hiroki Okabe, Shin-ya Imai (Gunma Univ.) MBE2015-56 |
This research formulates a new optimal control model for reproducing human arm’s obstacle-avoiding movements through inc... [more] | MBE2015-56 pp.17-22 |
| R | 2015-05-22 14:35 |
Shimane | Okinoshima-Bunka-Kaikan | Search process for optimal paths in multi-objective network Natsumi Takahashi, Hisashi Yamamoto (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Xiao Xiao (Tokyo Met. Univ.), Koji Shingyochi (Jumonji Univ.) R2015-5 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] | R2015-5 pp.25-30 |
| IBISML | 2014-11-18 15:00 |
Aichi | Nagoya Univ. | [Poster Presentation]
Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML2014-78 |
In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman p... [more] | IBISML2014-78 pp.321-328 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2013-11-28 10:00 |
Kagoshima | ILP-Based Placement and Routing Method for PLDs for Minimizing Critical Path Length Hiroki Nishiyama, Masato Inagi, Shinobu Nagayama, Shin'ichi Wakabayashi (Hiroshima City Univ.) RECONF2013-49 |
In this paper, we propose an ILP-based method for simultaneous optimal technology mapping, placement and routing for pro... [more] | RECONF2013-49 pp.57-62 |
|
| PRMU, IBISML, IPSJ-CVIM [detail] | 2011-09-05 13:30 |
Hokkaido | [Invited Talk]
Optimal Solution Path Following Algorithm for Pattern Recognition and Machine Learning Ichiro Takeuchi (NIT) PRMU2011-66 IBISML2011-25 |
Many pattern classification and machine learning algorithms are formulated as mathematical optimization problems. These ... [more] | PRMU2011-66 IBISML2011-25 pp.59-60 |
|
| IN, NV (Joint) |
2011-07-21 13:50 |
Hokkaido | Hokkaido University | Evolutionary Optimal Topologies for Accommodating Traffic Growth Aleksander Zaras, Shin'ichi Arakawa, Masayuki Murata (Osaka Univ.) IN2011-50 |
Modern wide-area, Wavelength Division Multiplexing-based network topologies are often meant to have a much longer lifeti... [more] | IN2011-50 pp.29-34 |
| MoNA, IPSJ-AVM | 2011-07-14 13:20 |
Nara | Nara Institute of Science and Technology | SCTP Optimum Path Selection using Ant Colony Optimization Approach and Heartbeat Chunks Muhammad Ariff Bin Baharudin, Eiji Kamioka (Shibaura Inst. of Tech.) MoMuC2011-13 |
This paper proposes an optimum path selection approach by using the Ant Colony Optimization (ACO) technique and HEARTBEA... [more] | MoMuC2011-13 pp.1-6 |
| KBSE | 2011-01-25 13:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Data Structure that Makes Extended Dijkstra Method Work. Tomoaki Ogawa (NIT) |
Routes selection is one of the most important problems for a car navigation system．Moreover, when selecting a path, the ... [more] | |
| MSS, CAS | 2010-11-19 16:10 |
Osaka | Kansai Univ. | Braess's Paradox in Graph B^k with Two Sources Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-82 CST2010-55 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-82 CST2010-55 pp.95-99 |
[Return to Top Page]