Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
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 |
MSS, CAS, IPSJ-AL [detail] |
2020-11-25 16:10 |
Online |
Online |
Distributed convex optimization with inequality constraints over directed graphs based on row stochasticity Hiroaki Sakuma, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) CAS2020-22 MSS2020-14 |
Distributed optimization is a method in which agents exchange information on the network to obtain the optimal solution ... [more] |
CAS2020-22 MSS2020-14 pp.16-21 |
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 |
RCS |
2020-04-23 - 2020-04-24 |
Online |
Online |
Optimal Transmission Strategy Realizing Minimum Age-of-Information of Energy Harvesting Users over Multiple-Access Channels Naoya Hirosawa (The Univ. Electro-Communications), Hiroki Iimori (JUB), Koji Ishibashi (The Univ. Electro-Communications), Giuseppe Abreu (JUB) RCS2020-8 |
In this paper, we study a sensor network composed of multiple energy harvesting nodes being capable of collecting energy... [more] |
RCS2020-8 pp.43-48 |
SP, EA, SIP |
2020-03-02 13:00 |
Okinawa |
Okinawa Industry Support Center (Cancelled but technical report was issued) |
[Poster Presentation]
Restoration of clipped signal using oversampling based on differentiable and convex loss function Natsuki Ueno, Shoichi Koyama, Hiroshi Saruwatari (Univ. Tokyo) EA2019-126 SIP2019-128 SP2019-75 |
A signal reconstruction method of clipped time-continuous signal using oversampling is proposed. The signal reconstructi... [more] |
EA2019-126 SIP2019-128 SP2019-75 pp.147-152 |
COMP |
2020-03-01 11:30 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga (Chuo Univ.) COMP2019-48 |
The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] |
COMP2019-48 p.23 |
CS, CAS |
2020-02-27 14:30 |
Kumamoto |
|
An Estimation of Network Traffic Validation based on Sparse Coding Takayuki Nakachi, Yitu Wang (NTT) CAS2019-107 CS2019-107 |
With accurate network traffic prediction, future communication networks can realize self-management and enjoy intelligen... [more] |
CAS2019-107 CS2019-107 pp.55-60 |
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 |
SIS |
2019-12-12 15:45 |
Okayama |
Okayama University of Science |
[Invited Talk]
Consensus-Based Distributed Algorithms and Applications to Machine Learning Norikazu Takahashi (Okayama Univ.) SIS2019-29 |
Recently, consensus-based distributed optimization methods for multi-agent systems have been vigorously studied in the f... [more] |
SIS2019-29 p.35 |
NLP, CAS |
2019-10-22 12:30 |
Gifu |
Gifu Univ. |
[Invited Talk]
Evolutionary multiobjective optimization and nonlinear circuits Toshimichi Saito (HU) CAS2019-29 NLP2019-69 |
Multiobjective optimization problems have been studies in various fields of science. The multiobjective optimization pro... [more] |
CAS2019-29 NLP2019-69 p.33 |
MIKA (2nd) |
2019-10-03 13:35 |
Hokkaido |
Hokkaido Univ. |
[Invited Lecture]
DOA Estimation Using Sparse Modeling Toshihiko Nishimura, Seigi Nakatsu, Takeo Ohgane, Yasutaka Ogawa (Hokkaido Univ.) |
The problem of estimating the direction of arrival (DOA) of radio waves from signals received by multiple antennas is a ... [more] |
|
NLP |
2019-09-23 13:20 |
Kochi |
Eikokuji Campus, University of Kochi |
Artificial Bee Colony Algorithm Following Time-Varying Solutions Ken Kamiyotsumoto, Yoko Uwate (Tokushima Univ.), Thomas Ott (ZHAW), Yoshifumi Nishio (Tokushima Univ.) NLP2019-42 |
Recently , nature-inspired metaheuristic optimization algorithms such as Artificial Bee Colony Algorithm (ABC) is develo... [more] |
NLP2019-42 pp.37-40 |
COMP |
2019-09-02 11:25 |
Okayama |
Tsushima Campus, Okayama University |
Speeding-up of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11 |
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] |
COMP2019-11 pp.7-14 |
SeMI, RCS, NS, SR, RCC (Joint) |
2019-07-12 11:25 |
Osaka |
I-Site Nanba(Osaka) |
Research and Development on Wide Area Network Scan Techniques for IoT Wireless Equipment Kazuto Yano, Naoto Egashira, Takuya Kurihara, Satoru Shimizu, Yoshinori Suzuki (ATR) RCC2019-49 NS2019-85 RCS2019-142 SR2019-61 SeMI2019-58 |
This paper introduces three elemental technologies to realize confident and efficient network scanning for a large amoun... [more] |
RCC2019-49 NS2019-85 RCS2019-142 SR2019-61 SeMI2019-58 pp.177-182(RCC), pp.203-208(NS), pp.199-204(RCS), pp.209-214(SR), pp.191-196(SeMI) |
RCS |
2019-06-21 10:30 |
Okinawa |
Miyakojima Hirara Port Terminal Building |
A Study on Age-of-Information Minimization in Two-User Multiple Access Channel with Energy Harvesting Naoya Hirosawa, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-88 |
In this paper, two-user multiple access channel is investigated where users, namely sensor nodes (SNs), transmit their d... [more] |
RCS2019-88 pp.297-302 |
NC, IBISML, IPSJ-MPS, IPSJ-BIO [detail] |
2019-06-17 15:50 |
Okinawa |
Okinawa Institute of Science and Technology |
A Comparison of Surrogate Models in Bayesian Optimization Sho Shimoyama (Meiji Univ.), Masahiro Nomura (CA) IBISML2019-7 |
Bayesian optimization can efficiently select the next search point by using a surrogate model that estimates an objectiv... [more] |
IBISML2019-7 pp.43-50 |
QIT (2nd) |
2019-05-20 16:10 |
Fukuoka |
Kyushu University, Chikushi Campus |
Sequential minimal optimization for quantum-classical hybrid algorithms Ken M. Nakanishi (The Univ. of Tokyo), Keisuke Fujii (Osaka Univ.), Synge Todo (The Univ. of Tokyo) |
We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is ... [more] |
|
NLP, MSS (Joint) |
2019-03-14 17:10 |
Fukui |
Bunkyo Camp., Univ. of Fukui |
[Invited Talk]
Optimization Algorithms for Deregulation of Electric Power Market Marta Marmiroli (MITSUBISHI ELECTRIC) MSS2018-91 |
[more] |
MSS2018-91 pp.57-58 |
NLP, NC (Joint) |
2019-01-24 15:00 |
Hokkaido |
The Centennial Hall, Hokkaido Univ. |
A Genetic Algorithm-Based Method for Finding Approximate Solutions to Minimum Steiner Tree Problems Li-Ping Zhang, Norikazu Takahashi (Okayama Univ.), Zong-Xiao Yang (HAUST) NLP2018-121 |
The Euclidean Steiner Tree Problem (ESTP) is a classical combinatorial optimization problem that appears in various fiel... [more] |
NLP2018-121 pp.131-136 |
IN |
2019-01-21 15:35 |
Aichi |
WINC AICHI |
An Energy-harvesting-aware Routing Algorithm Considering Residual Capacity of Batteries for WSN Zihao Zhang, Shigetomo Kimura (Univ. of Tsukuba) IN2018-77 |
In a wireless sensor network, a large number of sensor nodes equipped with calculation, sensing, and wirelesscommunicati... [more] |
IN2018-77 pp.31-36 |