| 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 # | |
| NS, IN (Joint) |
2024-03-01 14:15 |
Okinawa | Okinawa Convention Center | A Study of MPQUIC Packet Scheduler Based on Unacknowledged Time for Remote Monitoring of Autonomous Driving Hiroki Iwasawa, Seiya Komatsu, Taichi Kawano, Takuya Tojo (NTT)  NS2023-230 |
The realization of autonomous driving is awaited. In Japan, driverless autonomous driving on public roads is finally app... [more] | NS2023-230 pp.342-347 |
| IN, IA (Joint) |
2023-12-22 15:15 |
Hiroshima | Satellite Campus Hiroshima | A Scheduling Algorithm for On-Demand Transportation Services with Patrolling Functions in Local Communities Sato Kamimura, Koki Adachi, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IA2023-54 |
With Japan’s declining birthrate, aging population, and labor shortage rapidly progressing, the nation is in dire need o... [more] | IA2023-54 pp.53-58 |
| RISING (3rd) |
2023-10-31 14:00 |
Hokkaido | Kaderu 2・7 (Sapporo) | [Poster Presentation]
Optimal Compression Rate for Multiple Data Compression Techniques in Data Parallel Distributed Deep Learning Ryudai Fukuda, Takuji Tachibana (Univ. Fukui) |
In distributed deep learning, where multiple processors are used, the learning time can be significantly reduced by exec... [more] | |
| NS | 2023-10-05 10:10 |
Hokkaido | Hokkaidou University + Online (Primary: On-site, Secondary: Online) |
[Encouragement Talk]
Communication Scheduling Based on Heuristic Algorithm in Distributed Deep Learning Ryudai Fukuda, Takuji Tachibana (Univ. Fukui) NS2023-86 |
In distributed deep learning, where multiple processors are used, the learning time can be significantly reduced by exec... [more] | NS2023-86 pp.83-88 |
| SS, KBSE, IPSJ-SE [detail] | 2023-07-20 15:15 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Instruction Scheduling for GPUs Utilizing Subwarp Interleaving Junji Fukuhara, Munehiro Takimoto (TUS) SS2023-4 KBSE2023-15 |
Graphics Processing Units (GPUs) exploit the Single-Instruction Multiple-Thread (SIMT) execution model, which causes bra... [more] | SS2023-4 KBSE2023-15 pp.19-24 |
| CS, CQ (Joint) |
2023-05-18 15:10 |
Kagawa | Rexxam Hall (Kagawa Kenmin Hall) (Primary: On-site, Secondary: Online) |
On the performance of sorting out invalid jobs in scheduling using the policy gradient method for deadline-aware jobs Tatusya Sagisaka, Kohei Shiomoto (TCU), Takashi Kurimoto (NII) CQ2023-1 |
When transferring data in the field of communication between data centers, existing methods such as Earliest Deadline Fi... [more] | CQ2023-1 pp.1-6 |
| COMP, IPSJ-AL | 2023-05-10 14:30 |
Hokkaido | Hokkaido University | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| IN, NS (Joint) |
2023-03-02 13:40 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Path Planning and Scheduling of Automated Guided Vehicles Iteratively Carrying Items Sumihiro Yoneyama, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2022-82 |
This paper deals with a route planning scheduling algorithm for an automated guided vehicle (AGV) that repeatedly transp... [more] | IN2022-82 pp.97-102 |
| IN, NS (Joint) |
2023-03-02 16:20 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Generalization of Semi-optimal Hop-by-Hop File Delivery Scheduling for Two-link model Shuto Kataoka, Yoshiaki Kitaguchi, Katsunori Yamaoka (Tokyo Tech) IN2022-92 |
This paper aims to extend the scheduling range in a hop-by-hop file delivery system. First, for the merging model, we pr... [more] | IN2022-92 pp.157-162 |
| RCS, NS (Joint) |
2022-12-15 16:10 |
Aichi | Nagoya Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
A Study on Outer Loop Link Adaptation in Massive MIMO with Multi-user Detection via Generalized Approximate Message Passing Takanobu Doi, Jun Shikida, Daichi Shirase, Kazushi Muraoka, Naoto Ishii (NEC), Takumi Takahashi (Osaka Univ.), Shinsuke Ibi (Doshisha Univ.) RCS2022-196 |
With the ever-growing demand for uplink communications in beyond fifth generation mobile communications (beyond 5G), mas... [more] | RCS2022-196 pp.57-62 |
| NS, IN (Joint) |
2022-03-10 11:20 |
Online | Online | Semi-optimal Hop-by-Hop File Delivery Scheduling for Two-Stage Links with Branches Shuto Kataoka, Yoshiaki Kitaguchi, Katsunori Yamaoka (Tokyo Tech) IN2021-34 |
In this paper, for the Hop-by-Hop file delivery system, we propose a quasi-optimal algorithm for two-stage link with bra... [more] | IN2021-34 pp.19-24 |
| VLD, HWS [detail] | 2022-03-07 10:00 |
Online | Online | A Heuristic Scheduling Algorithm with Variable-Cycle Approximate Operations in High-Level Synthesis Koyu Ohata, Hiroki Nishikawa, Xiangbo Kong, Hiroyuki Tomiyama (Ritsumeikan Univ.) VLD2021-78 HWS2021-55 |
This paper studies a scheduling algorithm for high-level synthesis that takes into account the difference in delay betwe... [more] | VLD2021-78 HWS2021-55 pp.13-18 |
| SS, MSS | 2022-01-11 16:40 |
Nagasaki | Nagasakiken-Kensetsu-Sogo-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
Study on Stability of Distributed Scheduling Using Alternating Direction Method of Multipliers Naoki Niiya, Toshiyuki Miyamoto (Osaka Univ.), Daichi Inoue, Toyohiro Umeda (KOBELCO), Shigemasa Takai (Osaka Univ.) MSS2021-42 SS2021-29 |
In recent years, the development of optimization methods in multi-agent systems has been remarkable. We have proposed a ... [more] | MSS2021-42 SS2021-29 pp.64-69 |
| MSS, CAS, IPSJ-AL [detail] | 2021-11-19 10:55 |
Online | Online | Ising Model Formulation for Job-shop Scheduling Problems based on Petri Nets Modeling Kohei Kaneshima, Morikazu Nakamura (Univ. of the Ryukyus) CAS2021-48 MSS2021-28 |
Quantum annealing has been drawing attention as a fast algorithm for solving combinatorial optimization problems. The o... [more] |
CAS2021-48 MSS2021-28 pp.64-69 |
| CAS, NLP | 2021-10-15 13:00 |
Online | Online | Search Algorithms for Stowage Planning with Loading and Unloading Using Sequence-Triple Taiki Suzuki, Toshihiko Takahashi (Niigata Univ.) CAS2021-34 NLP2021-32 |
Stowage Planning is the problem determining an arrangement of given loads in a container of a desired size. In this rep... [more] |
CAS2021-34 NLP2021-32 pp.95-100 |
| CS | 2021-07-16 09:10 |
Online | Online | Deployment Scheduling Method Considering Drone Connectivity in Drone Communication Networks. Hirofumi Osumi, Tomotaka Kimura (Doshisha Univ.), Koji Hirata (Kansai Univ.), Jun Cheng (Doshisha Univ.) CS2021-26 |
In this paper, we consider a deployment scheduling problem taking into account the connectivity of drones in drone netwo... [more] | CS2021-26 pp.50-54 |
| HWS | 2021-04-12 10:25 |
Tokyo | Tokyo University/Online (Primary: On-site, Secondary: Online) |
Approximate Solution of Large-Scale Job Shop Scheduling Problem and Its Application to Hardware Cryptographic Design Kento Ikeda, Makoto Ikeda (Tokyo Univ.) HWS2021-2 |
The optimal design of cryptographic data paths in hardware can be considered as a job-shop scheduling problem. This prob... [more] | HWS2021-2 pp.7-12 |
| CPSY, DC, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC [detail] | 2021-03-25 11:40 |
Online | Online | Scheduling algorithms for sporadic and periodic tasks in multiprocessors Yuki Mori, Nobuyuki Yamasaki (Keio Univ.) CPSY2020-54 DC2020-84 |
Among embedded systems that are embedded in devices to ealize specific functions, systems that need to meet time onstra... [more] | CPSY2020-54 DC2020-84 pp.25-30 |
| SIP, IT, RCS | 2021-01-22 10:15 |
Online | Online | Proposal of a Method for Reducing the Amount of Calculation for Downlink Non-orthogonal Multiple Access Yohei Ishii, Toshinori Suzuki, Hideki Yoshikawa (Tohoku Gakuin Univ) IT2020-86 SIP2020-64 RCS2020-177 |
In this paper, we propose a method to reduce the amount of calculation, which has been a problem in the conventional met... [more] | IT2020-86 SIP2020-64 RCS2020-177 pp.125-130 |
| COMP | 2020-10-23 15:40 |
Osaka | Osaka Univ. (Primary: On-site, Secondary: Online) |
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead Koji M. Kobayashi (UT) COMP2020-15 |
The bounded delay buffer management problem proposed by Kesselman et~al. (STOC 2001 and SIAM Journal on Computing 33(3),... [more] | COMP2020-15 pp.26-32 |
[Return to Top Page]