Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP |
2024-05-09 15:05 |
Kagawa |
Kagawa Prefecture Social Welfare Center |
A Gray Wolf Optimization Method with Adaptive Large Neighborhood Search for the Traveling Salesman Problems Rikuto Shibutani, Takayuki Kimura (NIT) |
(To be available after the conference date) [more] |
|
NLP |
2024-05-09 16:20 |
Kagawa |
Kagawa Prefecture Social Welfare Center |
Adaptive large neighborhood search for vehicle routing problem with drones Kazuma Nakajima, Takafumi Matsuura, Takayuki Kimura (NIT) |
(To be available after the conference date) [more] |
|
SIP, IT, RCS |
2024-01-18 09:30 |
Miyagi |
(Primary: On-site, Secondary: Online) |
The quantum decoding attaining the minimum guesswork with single-qubit side information Michele Dall'Arno (TUT) IT2023-36 SIP2023-69 RCS2023-211 |
The minimum guesswork quantifies the minimum number of queries needed to guess the value of a random variable, when only... [more] |
IT2023-36 SIP2023-69 RCS2023-211 pp.37-38 |
CCS |
2023-11-11 15:00 |
Toyama |
Toyama Prefectural University |
[Invited Talk]
Quantum-Annealing-Inspired Swarm-Intelligence-Like Simulated Annealing Algorithm Akio Yoshizawa (AIST) CCS2023-29 |
Quantum-inspired classical algorithms for combinatorial optimization have been attracting great attention recently. The ... [more] |
CCS2023-29 pp.25-30 |
RCS |
2023-06-14 10:30 |
Hokkaido |
Hokkaido University, and online (Primary: On-site, Secondary: Online) |
Scalable Network-Assisted Full-Duplex Cell-Free Massive MIMO Systems with Limited Fronthaul Capacity Koushi Okui (UEC), Kengo Ando (CU), Koji Ishibashi (UEC) RCS2023-33 |
This paper proposes a scalable network-assisted full-duplex (NAFD) cell-free massive MIMO (CF-mMIMO) system that achieve... [more] |
RCS2023-33 pp.31-36 |
QIT (2nd) |
2023-05-29 16:30 |
Kyoto |
Katsura Campus, Kyoto University |
[Poster Presentation]
Improvement of QAOA for Solving TSP Efficiently Hiroki Akita, Hiroshi Sekigawa, Wataru Takeda (TUS) |
Quantum Approximate Optimization Algorithm (QAOA) is one of the most known quantum algorithms made for solving optimizat... [more] |
|
NLP, MSS |
2023-03-16 11:00 |
Nagasaki |
(Primary: On-site, Secondary: Online) |
A Method of Solving Posting Poster Problem for Public Office Election Using Min-max Type Objective Function Fengkai Guo, Honami Tsushima (Tokyo univ. of science), Jun Adachi, Takafumi Matsuura, Takayuki Kimura (Nippon Institute of Technology), Tohru Ikeguchi (Tokyo univ. of science) MSS2022-83 NLP2022-128 |
To realize effective posting process of posters in public office elections, we have already proposed the Posting Poster ... [more] |
MSS2022-83 NLP2022-128 pp.104-109 |
CAS, CS |
2023-03-02 10:20 |
Fukuoka |
Kitakyushu International Conference Center (Primary: On-site, Secondary: Online) |
Parameterizarion Method for Rapid Solving by Duplicating Spins in Ising Model Kasumi Fukui, Kunihiro Fujiyoshi (TUAT) CAS2022-113 CS2022-90 |
The solution of combinatorial optimization problems based on the Ising Model is expected to find a quasi-optimal
soluti... [more] |
CAS2022-113 CS2022-90 pp.101-106 |
NC, NLP |
2023-01-28 15:30 |
Hokkaido |
Future University Hakodate (Primary: On-site, Secondary: Online) |
On Posting Poster Problem for Public Office Elections Tohru Ikeguchi (TUS) NLP2022-91 NC2022-75 |
One of the election activities in a public office election is the posting of posters for candidates on the day of the pu... [more] |
NLP2022-91 NC2022-75 pp.52-57 |
QIT (2nd) |
2022-12-08 14:00 |
Kanagawa |
Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Hybrid Algorithm with Heterogeneous Ising Machines Akane Amino, Tomohiro Hattori, Shuta Kikuchi, Shu Tanaka (Keio Univ.) |
For combinatorial optimization problems with many variables to be input by the number of variables in
Ising machines, s... [more] |
|
QIT (2nd) |
2022-12-08 14:00 |
Kanagawa |
Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Static and Dynamic Properties of Error Mitigation Methods for Ising Machines Kanta Hino, Shu Tanaka (Keio Univ.) |
It is an essential issue in the field of Ising machines to mitigate errors as much as possible. In this study, we invest... [more] |
|
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] |
2022-11-29 14:15 |
Kumamoto |
(Primary: On-site, Secondary: Online) |
Method of Halved Interaction Elements with Regularity Arrangement that achieves Independent Double Systems for Scalable Fully Coupled Annealing Processing Shinjiro Kitahara, Akari Endo, Taichi Megumi, Takayuki Kawahara (TUS) VLD2022-31 ICD2022-48 DC2022-47 RECONF2022-54 |
In recent years, annealing processors have been developed as solutions to large-scale combinatorial optimization problem... [more] |
VLD2022-31 ICD2022-48 DC2022-47 RECONF2022-54 pp.72-77 |
CCS |
2022-11-17 13:50 |
Mie |
(Primary: On-site, Secondary: Online) |
A chaotic search method with stochastic solution transitions for electric vehicle routing problem with time windows Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) CCS2022-45 |
Rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that minim... [more] |
CCS2022-45 pp.9-13 |
CAS, NLP |
2022-10-21 11:15 |
Niigata |
(Primary: On-site, Secondary: Online) |
Rapid Solving by Duplicating Spins in Ising Model Kasumi Fukui, Kunihiro Fujiyoshi (TUAT) CAS2022-30 NLP2022-50 |
The solution of combinatorial optimization problems based on the Ising model may obtain a quasi-optimal solution by mapp... [more] |
CAS2022-30 NLP2022-50 pp.56-59 |
IN, CCS (Joint) |
2022-08-05 11:10 |
Hokkaido |
Hokkaido University(Centennial Hall) (Primary: On-site, Secondary: Online) |
A chaotic search method for Electric Vehicle Routing Problems with Time Windows that allow Partial Recharging in recharge stations Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) CCS2022-38 |
The rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that m... [more] |
CCS2022-38 pp.60-65 |
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 |