IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 86  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
NLP, CCS 2021-06-11
11:25
Online Online The Electric Vehicle Routing Problems with Time Windows Using Optimized Charging Methods for Vehicle's Batteries
Jun Adachi, Sae Suzuki, Takayuki Kimura (NIT) NLP2021-4 CCS2021-4
Because of the rapid increase of delivery goods and truck drivers shortage, efficient delivery routes that minimize vehi... [more] NLP2021-4 CCS2021-4
pp.14-19
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
CAS, ICTSSL 2021-01-28
14:25
Online Online Design of IIR Filter Using Novel Constraint-handling Method
Yuta Harigae, Kenji Suyama (Tokyo Denki Univ.) CAS2020-47 ICTSSL2020-32
In previous work, the design methods of IIR filter using metaheuristics have been proposed.
The penalty function method... [more]
CAS2020-47 ICTSSL2020-32
pp.46-51
R 2020-11-30
13:00
Online Online Ant Colony Optimization Algorithm Based on Birnbaum Importance and Necessary Condition for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System
Issin Honma, Hisashi Yamamoto (Tokyo Metropolitan Univ.), Taishin Nakamura (Tokai Univ.) R2020-23
In this study, we propose an ant colony optimization algorithm based on Birnbaum importance and necessary conditions for... [more] R2020-23
pp.1-6
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
NLP, NC
(Joint)
2020-01-23
16:00
Okinawa Miyakojima Marine Terminal A Control Method for Searching for A Feasible and An Infeasible Solution Space of A multiple-Vehicle Bike Sharing System Routing Problem
Honami Tsushima, Takayuki Kimura, Takafumi Matsuura (NIT) NLP2019-86
To adjust the number of bicycles at each ports in the Bike Sharing System, we have already defined a multiple-Vehicle Bi... [more] NLP2019-86
pp.13-18
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
SITE 2019-12-06
13:50
Kanagawa   Deciding Equivalence of The Rule List Policies via SAT solver
Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) SITE2019-82
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] SITE2019-82
pp.13-19
QIT
(2nd)
2019-11-18
13:50
Tokyo Gakushuin University [Poster Presentation] Quantum Annealing for Minimum Cut of a Simple Graph
Kanto Teranishi, Shota Nagayama (Mercari)
Quantum Annealing, a quantum algorithm which finds the ground states of ising model, is provided in a cloud and attracts... [more]
COMP 2019-10-25
14:40
Hokkaido Sapporo Campus, Hokkaido University A Rule Reordering Method via Deleting 0 Weights Rules
Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech.), Tanaka Ken (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-24
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] COMP2019-24
pp.47-52
R 2019-05-24
16:40
Aichi Aichi Institute of Technology, Motoyama Campus [Invited Talk] Determining line replaceable units in multi-level systems
Won Young Yun, Jae Yoon Yoo (PNU) R2019-8
This talk deals with a maintenance optimization problem of multi-level systems. Multi-level systems consist of modules a... [more] R2019-8
p.41
ET 2019-01-26
14:35
Osaka Umeda Campus, Kansai University Effects of readers’ beliefs and heuristics on moral reading
Yohei Okibayashi, Keigo Fujinaga, Takane Kubota, Yoshiki Matsuoka (Yamaguchi Univ.) ET2018-82
In this research, the experiment was conducted the following experiments on 60 university students. In the experiments, ... [more] ET2018-82
pp.31-34
AI 2018-07-02
10:25
Hokkaido   Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones
Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] AI2018-2
pp.7-10
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
NLP 2018-04-27
16:35
Kumamoto Kumaoto Univ. A Particle Swarm Optimizer Based on Periodically Swiched Particle Networks
Santana Sato, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2018-27
In this paper, we propose a method to periodically switch the couplings between particles in Particle Swarm Optimization... [more] NLP2018-27
pp.133-137
TL 2018-03-19
18:30
Tokyo Waseda University Possibility of Cognitive Transformation by using Image Exercise -- Attempt of Individual Separation from Others with Phyllis Krystal Method --
Harumi Koyama (PKM) TL2017-75
The purpose of this research is to consider how by using Image Exercise it is possible of Individual Separation from oth... [more] TL2017-75
pp.91-96
NS, IN
(Joint)
2018-03-02
11:30
Miyazaki Phoenix Seagaia Resort A Study on Group Organization Considering Density of the Elderly in Online Elderly Watching System of Local Community
Shota Tatsukawa, Yosuke Tanigawa, Hedeki Tode (OPU) NS2017-209
Lately, the problem in caring for the elderly appears because of rapid aging of the population resulting from the declin... [more] NS2017-209
pp.237-242
NLP 2017-11-05
14:00
Miyagi Research Institute of Electrical Communication Tohoku University Optimization for switching phase of PWM inverter
Asuna Yamasaki, Kenya Jin'no (NIT) NLP2017-67
In this article, we optimize the switching phase of the PWM inverter by using a differential evolution algorithm to impr... [more] NLP2017-67
pp.13-18
IN 2017-07-19
09:40
Hokkaido Japan Red Cross Hokkaido College of Nursing Network Reduction Method that Minimizes Total Capacity Change for Virtual Network Embedding Acceleration
Toru Mano, Takeru Inoue, Kimihiro Mizutani (NTT), Shin-ichi Minato (Hokkaido Univ.), Osamu Akashi (NTT) IN2017-21
Virtual network (NW) embedding technology is essential for NW virtualization. Although the linear programming relaxation... [more] IN2017-21
pp.13-18
 Results 1 - 20 of 86  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan