| 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 # | |
| 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 |
|
| QIT (2nd) |
2019-11-18 11:00 |
Tokyo | Gakushuin University | [Invited Talk]
Simulated bifurcation algorithm
-- Combinatorial optimization based on classical adiabatic evolution -- Hayato Goto (Toshiba) |
We have recently proposed a heuristic algorithm for combinatorial optimization, which is based on the numerical simulati... [more] | |
| VLD, DC, CPSY, RECONF, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2019-11-14 14:15 |
Ehime | Ehime Prefecture Gender Equality Center | Solving Traveling Salesman Problem Using Grid Partitioning via Ising-Model based Solver Akira Dan, Takeshi Nishikawa, Takashi Sato (Kyoto Univ.) VLD2019-40 DC2019-64 |
Ising-model based solver is gaining increasing attention for its efficiency in finding approximate solutions for com... [more] |
VLD2019-40 DC2019-64 pp.97-102 |
| NLP, CAS | 2019-10-22 08:50 |
Gifu | Gifu Univ. | A Study of Grouping Procedure Using Local Search Method for Carpooling Optimization Problems Kosei Takahashi, Toshichika Aoki, Takayuki Kimura (Nippon Institute of Tech) CAS2019-23 NLP2019-63 |
Sharing a car while commuting with others is called carpool. Recently, many carpool applications such as Uber and Lyft h... [more] | CAS2019-23 NLP2019-63 pp.1-6 |
| 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 |
| SDM, ICD, ITE-IST [detail] | 2019-08-07 13:30 |
Hokkaido | Hokkaido Univ., Graduate School /Faculty of Information Science and | [Invited Talk]
A Scalable CMOS Annealing Processor for Solving Large-scale Combinatorial Optimization Problems Masato Hayashi, Takashi Takemoto, Chihiro Yoshimura, Masanao Yamaoka (Hitachi) SDM2019-36 ICD2019-1 |
This paper presents a CMOS annealing processor (CMOS-AP) that accelerates ground state searches of the Ising model. The ... [more] | SDM2019-36 ICD2019-1 pp.1-5 |
[Return to Top Page]