| 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, MSS | 2023-03-15 16:35 |
Nagasaki | (Primary: On-site, Secondary: Online) |
An Trial to Replace Chaotic Neural Networks with Hidden Markov Models.
-- A Case of Method for Solving Asymmetric Traveling Salesman Problems -- Toshihiro Tachibana, Tomoya Matsuno (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.), Kaya Nagasawa (Shonan Inst. of Tech.)  MSS2022-78 NLP2022-123 |
We have proposed a method for adaptive switching between multiple methods using chaotic neural networks. Our research ha... [more] | MSS2022-78 NLP2022-123 pp.81-84 |
| MSS, NLP | 2022-03-29 13:00 |
Online | Online | A Relation between Gap and City Layout for Asymmetric Traveling Salesman Problems Using Hidden Markov Models Toshihiro Tachibana, Tomoya Matsuno (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) MSS2021-74 NLP2021-145 |
We have proposed several methods for solving asymmetric traveling salesman problems and multi-objective optimization pro... [more] | MSS2021-74 NLP2021-145 pp.101-104 |
| CAS, ICTSSL | 2021-01-29 10:10 |
Online | Online | Consideration of Switching by Chaotic Neurodynamics for Asymmetric TSPs by using Hidden Markov Model Tomoya Matsuno, Toshihiro Tachibana (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) CAS2020-59 ICTSSL2020-44 |
Several methods for solving the asymmetric traveling salesman problem using chaotic neural networks is proposed by Tachi... [more] | CAS2020-59 ICTSSL2020-44 pp.107-110 |
| MSS, NLP (Joint) |
2018-03-14 15:20 |
Osaka | Method for Solving Asymmetric Traveling Salesman Problems by Dynamically Changes the Number of Cities Consider as One City Toshihiro Tachibana (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) NLP2017-113 |
In this paper, the authors extend a proposed method for asymmetric traveling salesman problems. Asymmetric traveling sal... [more] | NLP2017-113 pp.61-66 |
|
| CCS | 2017-03-10 10:30 |
Tokyo | ELSI, TITECH | Solving Asymmetric Traveling Salesman Problems by Coherent Ising Machine Yukio Murata (Tokyo Univ. of Science), Hiroyuki Yasuda (Univ. of Tokyo), Kaori Kuroda (Tokyo Univ. of Science), Kazuyuki Aihara (Univ. of Tokyo), Mikio Hasegawa (Tokyo Univ. of Science) CCS2016-46 |
The effectiveness of high-speed combinatorial optimization method using Coherent Ising Machine (CIM) has been shown. Hop... [more] | CCS2016-46 pp.7-12 |
| NLP | 2009-05-15 17:35 |
Shiga | Ritsumeikan University | Solving Asymmetric TSP by Combination of Chaotic Neurodynamics and Block Shift operations Toshihiro Tachibana, Masaharu Adachi (Tokyo Denki Univ.) NLP2009-13 |
In this paper, a method for solving Asymmetric Traveling Salesman Problems is proposed. Where the asymmetric TSP means t... [more] | NLP2009-13 pp.63-66 |
| NLP | 2007-12-20 14:15 |
Fukui | A Method for solving Asymmetric Traveling Salesman Problems using Block Shift Operations and Point Classification by Self-organizing Maps Toshihiro Tachibana, Masaharu Adachi (Tokyo Denki Univ.) NLP2007-127 |
In this report, an improved method for solving Asymmetric Travelling Salesman Problems (ATSP) is proposed. Where the asy... [more] | NLP2007-127 pp.35-40 |
|
[Return to Top Page]