| 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 10:20 |
Okinawa | Improved CSD-FIR Filter Design Performance by Reducing the Number of Penalized Individuals Hanqin Qi, Kenji Suyama (Tokyo Denki Univ.)  CAS2023-113 CS2023-106 |
A design method for CSD-FIR filters using PfGA has been proposed, in which a parameter adjustment is not required in adv... [more] | CAS2023-113 CS2023-106 pp.12-16 |
|
| R | 2021-07-17 14:25 |
Online | Virtual | Refined Ensemble Learning Algorithms for Software Bug Prediction
-- Metaheuristic Approach -- Keisuke Fukuda, Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2021-19 |
In this paper, we propose to apply three metaheuristic algorithms; latin hypercube sampling, ABC (artificial bee colon... [more] |
R2021-19 pp.18-23 |
| COMP | 2021-03-08 15:15 |
Online | Online | A hyper-heuristic for the maximum clique problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC) COMP2020-34 |
The maximum clique problem (MCP) is one of the most important combinatorial optimization problems that has many practica... [more] | COMP2020-34 pp.30-37 |
| NLP | 2020-05-15 13:50 |
Online | Online | Spy Algorithm for Solving Continuous Optimization Problem Dhidhi Pambudi, Masaki Kawamura (Yamaguchi Univ.) NLP2020-5 |
We proposed the Spy algorithm for solving continuous optimization problems on multimodal functions. The algorithm is one... [more] | NLP2020-5 pp.23-28 |
| NS, RCS (Joint) |
2019-12-20 13:30 |
Tokushima | Tokushima Univ. | [Encouragement Talk]
Service chain provisioning model with relaxation of virtual network function visit order and non-loop constraints Naoki Hyodo, Takehiro Sato, Ryoichi Shinkuma, Eiji Oki (Kyoto Univ.) NS2019-158 |
This paper presents a Virtual Network Function (VNF) placement model for Service Chaining (SC) which minimizes the cost ... [more] | NS2019-158 pp.127-132 |
| NLP | 2018-04-27 16:10 |
Kumamoto | Kumaoto Univ. | An ABC Algorithm with Improvement of Tracking Performance to Solutions in Dynamic Optimization Problems Masato Omika, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2018-26 |
We propose an ABC algorithm to dynamic optimization problems in this article. The proposed method makes the following tw... [more] | NLP2018-26 pp.127-131 |
| NS | 2017-01-26 13:25 |
Kagoshima | Kagoshima J-Kaikan | [Encouragement Talk]
A Study on Diversified Group Organization for Watching the Elderly in Local Community Network Shota Tatsukawa, Yosuke Tanigawa, Hideki Tode (OPU) NS2016-142 |
Lately, the problem in caring the elderly appears because of rapid aging of the population resulting from the decline in... [more] | NS2016-142 pp.7-12 |
| NLP, CCS | 2015-06-11 09:50 |
Tokyo | Waseda Univerisity | Analysis and evaluation of Firefly Algorithm Jianze Xiao, Takuya Shindo, Takuya Kurihara, Kenya Jin'no (NIT) NLP2015-41 CCS2015-3 |
Firefly algorithm is one of Metaheuristic optimization algorithms, it is inspired by the flashing and attracting behavio... [more] | NLP2015-41 CCS2015-3 pp.13-18 |
| NLP | 2015-01-26 10:00 |
Oita | Compal Hall | Finding plural solutions in high dimensional optimization problems using PSO with temporal couplings Kensuke Kimura, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-113 |
In the Particle Swarm Optimizer (PSO), the search performances can significantly decrease for high--dimensional optimiza... [more] | NLP2014-113 pp.1-5 |
| COMP | 2014-03-10 15:40 |
Tokyo | Amoeba-inspired Algorithm and Its Realization Using Nanodevice Hiroyoshi Miwa (Kwansei Gakuin Univ.), Mashashi Aono (Tokyo Tech/JST), Makoto Naruse (NICT), Seiya Kasai (Hokkaido Univ.) COMP2013-71 |
Many metaheuristic algorithms have been studied so far to search for fairy good solutions to intractable computational ... [more] | COMP2013-71 pp.77-82 |
|
| NS, IN (Joint) |
2014-03-07 09:10 |
Miyazaki | Miyazaki Seagia | Comparative evaluation of heuristic algorithms of time slot assignment for IEEE 802.16j relay networks Shoichi Takagi, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka (Osaka Univ.) NS2013-217 |
In IEEE 802.16j relay networks, the network performance is improved by decreasing the total number of different time slo... [more] | NS2013-217 pp.237-242 |
| CAS, NLP | 2013-09-26 14:30 |
Gifu | Satellite Campus, Gifu University | Optimization of Switching Phase of a Single Phase PWM DC-AC Inverter Kazuya Morita, Kenya Jin'no (Nippon Inst. of Tech.) CAS2013-40 NLP2013-52 |
With the aim to improve the efficiency of PWM DC-AC single-phase inverter, in this article, the switching phase of the P... [more] | CAS2013-40 NLP2013-52 pp.25-30 |
| NLP | 2013-07-08 10:25 |
Okinawa | Miyako Island Marine Terminal | A Partial Update PSO for High-Dimensional Optimization Problems Yasumasa Watanabe, Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2013-27 |
In the Particle Swarm Optimizer (PSO), the search performances can be significantly reduced for high-dimensional optimiz... [more] | NLP2013-27 pp.5-9 |
| NLP | 2012-12-17 13:25 |
Fukui | Fukui City Communication Plaza | Fundamental performance of searching ability of an asynchronous sequential PSO Takatsugu Sekiguchi, Takuya Shindo, Kenya Jin'no (Nippon Inst. Tech.) NLP2012-89 |
Particle Swarm Optimization (PSO) is recently attracted great attention. It is classified into one of heuristics solving... [more] | NLP2012-89 pp.7-12 |
| NLP | 2012-12-18 12:00 |
Fukui | Fukui City Communication Plaza | Optimization of switching phase of a single phase PWM DC-AC inverter Kazuya Morita, Takuya Kurihara, Kenya Jin'no (Nippon Inst. Tech) NLP2012-103 |
With the aim to improve the efficiency of PWM DC-AC single-phase nverter, in this article, the switching phase of the PW... [more] | NLP2012-103 pp.81-86 |
| CAS, CS, SIP | 2012-03-09 14:45 |
Niigata | The University of Niigata | Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta Koshin, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-145 SIP2011-165 CS2011-137 |
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] | CAS2011-145 SIP2011-165 CS2011-137 pp.213-218 |
| NS, IN (Joint) |
2012-03-09 10:10 |
Miyazaki | Miyazaki Seagia | Sensor Location Problem for Intruder Detection Yuta Nakazono, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2011-162 |
With the advancement of sensor network technology, sensor network systems are expected to be used for border security an... [more] | IN2011-162 pp.151-156 |
| CAS, NLP | 2011-10-20 10:50 |
Shizuoka | Shizuoka Univ. | Multi-Objective Optimization Using Chaotic Neural Network Masayuki Okazawa, Tomoya Suzuki (Ibaraki Univ.) CAS2011-35 NLP2011-62 |
There are various combinational optimization problems in the real world. Although there exist many solving algorithms f... [more] |
CAS2011-35 NLP2011-62 pp.13-18 |
| MBE | 2011-07-09 10:00 |
Tokushima | The University of Tokushima | An Automatic Scheduling Method of Clinical Exercises Hisashi Miyazaki, Isao Kayano, Osamu Hiramatsu (Kawasaki Univ), Sousuke Amasaki (Okayama Prefectural Univ) MBE2011-31 |
In this paper, we propose an automatic scheduling method of clinical exercises using tabu search that is one of the meta... [more] | MBE2011-31 pp.59-63 |
| COMP | 2011-03-09 13:35 |
Tokyo | Chuo Univ. | Evaluation of metaheuristic algorithms for Spanning Tree Congestion Daiki Maruta (Gunma Univ.), Yota Otachi (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.) COMP2010-50 |
Spanning tree congestion (STC) is a graph parameter which has been well studied recently. This work is to compare the... [more] |
COMP2010-50 pp.25-28 |
[Return to Top Page]