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 113  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CAS, SIP, VLD, MSS 2022-06-17
15:45
Aomori Hachinohe Institute of Technology
(Primary: On-site, Secondary: Online)
QUBO Model Formulation based on Petri net Behavior for Combinatorial Optimization Problems
Keisuke Tokuhira, Morikazu Nakamura, Mitsunaga Kinjo, Katsuhiko Shimabukuro (Univ. of the Ryukyus) CAS2022-18 VLD2022-18 SIP2022-49 MSS2022-18
This paper proposes a method to generate Ising or QUBO models based on Petri net behavioral properties for combinatorial... [more] CAS2022-18 VLD2022-18 SIP2022-49 MSS2022-18
pp.96-101
RECONF 2022-06-07
16:35
Ibaraki CCS, Univ. of Tsukuba
(Primary: On-site, Secondary: Online)
Design of a Quantum Annealing Accelerator for Sparse Ising Model
Yuta Ohma, Hasitha Muthumala Waidyasooriya, Masanori Hariyama (Tohoku Univ.) RECONF2022-10
(To be available after the conference date) [more] RECONF2022-10
pp.45-47
COMP, IPSJ-AL 2022-05-20
13:00
Online Online [Invited Talk] Planning with Explanations for Finding Desired Meeting Points on Graphs
Keisuke Otaki (TCRDL) COMP2022-7
Combinatorial optimization problems are ubiquitous for decision making. In real-world scenarios, a decision-maker needs ... [more] COMP2022-7
p.45
SR 2022-05-13
15:05
Tokyo NICT Koganei
(Primary: On-site, Secondary: Online)
[Invited Lecture] Optimization of Intelligent Reflecting Surface (IRS) Control by Quantum Computing
Takahiro Ohyama (PSNRD), Yuichi Kawamoto (Tohoku Univ.) SR2022-17
As a technology to greatly improve the energy utilization efficiency in the 6th generation mobile communication system (... [more] SR2022-17
pp.75-76
NS 2022-04-15
10:45
Tokyo kikai shinkou kaikan + online
(Primary: On-site, Secondary: Online)
[Encouragement Talk] An Actor-Critic based Reinforcement Learning Algorithm for Combinatorial Optimization and Mobile Power Trucks Routing Problem
Zhao Wang (NTT), Yuhei Senuma (Waseda Univ.), Yuusuke Nakano (NTT), Jun Ohya (Waseda Univ.), Ken Nishimatsu (NTT) NS2022-1
In this paper, we propose an Actor-Critic based reinforcement learning (RL) algorithm for solving the traditional combin... [more] NS2022-1
pp.1-6
NLP, MICT, MBE, NC
(Joint) [detail]
2022-01-22
13:15
Online Online A study on performance of local search methods for Electric Vehicle Routing Problem with Time Windows
Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2021-104 MICT2021-79 MBE2021-65
The rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that m... [more] NLP2021-104 MICT2021-79 MBE2021-65
pp.143-148
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
RECONF 2021-06-09
13:00
Online Online [Invited Talk] Large-scale combinatorial optimization in real-time systems by FPGA-based accelerators for simulated bifurcation
Kosuke Tatsumura (TOSHIBA) RECONF2021-11
Combinatorial optimization problems are economically valuable but computationally hard to solve. Many practical combinat... [more] RECONF2021-11
pp.56-61
ED, SDM, CPM 2021-05-27
16:05
Online Online Spin Updating Method by Sparsifying Exchange Interaction for Ising Spin Computing
Asaki Yoshida, Tsukasa Miki, Moe Shimada, Yuri Yoneda, Jun-ichi Shirakashi (Tokyo Univ. of Agr. & Tech.) ED2021-7 CPM2021-7 SDM2021-18
(To be available after the conference date) [more] ED2021-7 CPM2021-7 SDM2021-18
pp.27-30
COMP, IPSJ-AL 2021-05-08
13:30
Online Online [Invited Talk] Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project
Shin-ichi Minato (Kyoto Univ.) COMP2021-8
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] COMP2021-8
p.54
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, SS 2021-01-27
15:00
Online Online Speeding up combinatorial optimization solver CombSQL+ by introducing Pseudo-Boolean constraints
Junichiro Kishi, Masahiko Sakai, Naoki Nishida, Kenji Hashimoto (Nagoya univ.) MSS2020-40 SS2020-25
The authors have proposed a solver CombSQL+ for combinatorial optimization problems (COPs) described in extended SQL lan... [more] MSS2020-40 SS2020-25
pp.66-71
SR 2021-01-25
13:50
Online Online [Panel Discussion] Challenge of Amoeba-inspired Combinatorial Optimization Machines -- Promoting Efficient Manufacturing and Logistics for Realization of Society 5.0 --
Masashi Aono (Amoeba Energy) SR2020-51
The speaker has been developed combination optimization computers inspired by efficient foraging dynamics of an amoeboid... [more] SR2020-51
p.22
COMP 2020-12-04
12:50
Online Online [Invited Talk] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
Satoru Iwata (Univ. of Tokyo), Yu Yokoi (NII) COMP2020-22
Let $G=(V,E)$ be a multigraph with a set $Tsubseteq V$ of terminals. A path in $G$ is called a $T$-path if its ends are ... [more] COMP2020-22
p.28
COMP 2020-10-23
13:15
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
[Invited Talk] Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata, Taihei Oki (The Univ. of Tokyo), Mizuyo Takamatsu (Chuo Univ.) COMP2020-12
Differential-algebraic equations (DAEs) are widely used for the modeling of dynamical systems. The difficulty in numeric... [more] COMP2020-12
p.9
CCS, NLP 2020-06-05
13:00
Online Online Dynamically changing penalties method for Large-Scale multiple-Vehicle Bike Sharing System Routing Problem
Honami Tsushima (TUS), Takafumi Matsuura (NIT), Tohru Ikeguchi (TUS) NLP2020-14 CCS2020-4
In a bike sharing system (BSS) , we proposed a multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) to determin... [more] NLP2020-14 CCS2020-4
pp.19-22
NLP, NC
(Joint)
2020-01-23
15:40
Okinawa Miyakojima Marine Terminal A Study of Congestion Avoidance Method Using Transmission History Information
Akinori Yoshida, Toshichika Aoki, Takayuki Kimura (Nippon Institute of Tech) NLP2019-85
To avoiding the packet congestion, the efficient routing method using transmission history information has already been ... [more] NLP2019-85
pp.7-12
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
CAS, MSS, IPSJ-AL [detail] 2019-11-28
11:15
Fukuoka   QUBO solver for combinatorial optimization problems with constraints
Fumiyo Takano, Motoi Suzuki, Yuki Kobayashi, Takuya Araki (NEC) CAS2019-47 MSS2019-26
Quantum computers have been developed to solve combinatorial optimization problems mapped to the quadratic unconstrained... [more] CAS2019-47 MSS2019-26
pp.15-20
CAS, MSS, IPSJ-AL [detail] 2019-11-29
10:35
Fukuoka   A Solving Method for Computing and Network Resource Minimization Problem in Service Function Chaining against Multiple VNF Failures
Daiki Yamada, Norihiko Shinomiya (Soka Univ.) CAS2019-57 MSS2019-36
With the development of Network Function Virtualization (NFV), Service Function Chaining (SFC), which features high scal... [more] CAS2019-57 MSS2019-36
pp.85-90
 Results 1 - 20 of 113  /  [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