|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
AI |
2024-03-01 13:40 |
Aichi |
Room0221, Bldg.2-C, Nagoya Institute of Technology |
Applying Graph Neural Networks and Reinforcement Learning to the Multiple Depot-Multiple Traveling Salesman Problem Dongyeop Kim, Toshihiro Matsui (NITech) AI2023-39 |
In this study, we introduce a method combining Graph Neural Networks (GNN) and reinforcement learning for the Multiple D... [more] |
AI2023-39 pp.13-18 |
CCS, NLP |
2022-06-10 17:10 |
Osaka |
(Primary: On-site, Secondary: Online) |
Application of pairing optimization algorithm to non-orthogonal multiple access Naoki Fujita, Andre Roehm, Takatomo Mihana, Ryoichi Horisaki (The Univ. of Tokyo), Aohan Li (The Univ. of Electro-Communications), Mikio Hasegawa (Tokyo Univ. of Science), Makoto Naruse (The Univ. of Tokyo) NLP2022-25 CCS2022-25 |
Non-Orthogonal Multiple Access (NOMA) is a promising next-generation communication technology that enables multiple term... [more] |
NLP2022-25 CCS2022-25 pp.129-134 |
NLP, NC (Joint) |
2019-01-23 14:10 |
Hokkaido |
The Centennial Hall, Hokkaido Univ. |
Chaos Search Method for Multiple-Vehicle Bike Sharing System Routing Problem Honami Tsushima, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2018-106 |
A multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) is proposed as a combinatorial optimization problem to r... [more] |
NLP2018-106 pp.57-62 |
IBISML |
2014-11-18 15:00 |
Aichi |
Nagoya Univ. |
[Poster Presentation]
Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML2014-78 |
In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman p... [more] |
IBISML2014-78 pp.321-328 |
|
|
|
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]
|