| 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 | 2024-03-13 13:30 |
Misc. | Kikai-Shinko-Kaikan Bldg. | Mixed integer programming model for flexible job shop problems with process converging Kosuke Aoki, Masaki Nakamura, Kazutoshi Sakakibara (Toyama Prefectural Univ.)  MSS2023-76 NLP2023-128 |
In this paper, we propose a scheduling method for manufacturing sites that include production lines with convergence pro... [more] | MSS2023-76 NLP2023-128 pp.29-34 |
| NS, IN (Joint) |
2022-03-10 11:40 |
Online | Online | VNF/CNF migration scheduling based on Encoder-Decoder RNN for cloud native platform Takahiro Hirayama, Masahiro Jibiki, Takaya Miyazawa, Ved P. Kafle (NICT) IN2021-35 |
The 5th generation (5G) or beyond 5G (B5G) mobile networks are required to offer various kinds of services, such as enha... [more] | IN2021-35 pp.25-30 |
| SS, MSS | 2022-01-11 11:15 |
Nagasaki | Nagasakiken-Kensetsu-Sogo-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
[Invited Talk]
Distributed optimization of 0-1 mixed integer program using ADMM and COP Toshiyuki Miyamoto, Yuta Inoue (Osaka Univ.) MSS2021-34 SS2021-21 |
The problem of determining the up / down pattern of energy conversion equipment over a period of time and its output lev... [more] | MSS2021-34 SS2021-21 pp.19-22 |
| DC | 2021-12-10 14:20 |
Kagawa | (Primary: On-site, Secondary: Online) |
Kyozo Hida, Tatsuhiro Tsuchiya (Osaka Univ) DC2021-58 |
This paper addresses the problem of finding the set of the most vulnerable nodes in interdependent networks where initia... [more] | DC2021-58 pp.19-23 |
| SIP, CAS, VLD, MSS | 2021-07-06 10:50 |
Online | Online | Online Pickup and Delivery Problem under Temporal Logic Constraints koki kanashima, Toshimitu Ushio (Osaka Univ.) CAS2021-11 VLD2021-11 SIP2021-21 MSS2021-11 |
A pickup and delivery problem is to find optimal schedule to deliver goods to specified places after picking up them. Mo... [more] | CAS2021-11 VLD2021-11 SIP2021-21 MSS2021-11 pp.54-59 |
| CQ | 2020-07-17 14:15 |
Online | Online | High Reliability Network Design Problem Considering Reduction Cost of Failure Probability of Simultaneous Failure Sets Yuma Morino, Hiroyoshi Miwa (Kwansei Gakuin Univ.) CQ2020-33 |
It is important to design a robust information network resistant to network failures. The protection method to decrease ... [more] | CQ2020-33 pp.63-68 |
| SR, NS, SeMI, RCC, RCS (Joint) |
2020-07-08 13:25 |
Online | Online | Optimization of repeater combinations using integer programming Riku Ohmiya, Tomoki Murakami, Masashi Iwabuchi, Masaaki Nishino, Tomoaki Ogawa, Yasushi Takatori (NTT) RCS2020-63 |
In recent years, a new type repeater called IRS (Intelligent Reflecting Surface) that can reconfigure the propagation pa... [more] | RCS2020-63 pp.31-36 |
| MSS, NLP (Joint) |
2020-03-10 09:25 |
Aichi | (Cancelled but technical report was issued) |
Optimal Resource Allocation for Distributed Computing Environments based on Integer Programming Generation Shoya Kyan, Tomoya Uchihara, Morikazu Nakamura (Univ. of the Ryukyus) MSS2019-64 |
This paper considers resource assignment problems in distributed computing environments based on the automatic generatio... [more] | MSS2019-64 pp.37-42 |
| IN, NS (Joint) |
2019-03-05 14:30 |
Okinawa | Okinawa Convention Center | Study on VNF Migration Scheduling by using Encoder-Decoder Recurrent Neural Network Takahiro Hirayama, Takaya Miyazawa, Masahiro Jibiki, Ved P. Kafle (NICT) IN2018-142 |
Service function chaining (SFC) enables network operators to flexibly provide diverse services such as Internet-of-Thing... [more] | IN2018-142 pp.349-354 |
| COMP | 2018-12-12 10:50 |
Miyagi | Tohoku University | Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) COMP2018-33 |
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the cons... [more] | COMP2018-33 pp.15-20 |
| IBISML | 2018-11-05 15:10 |
Hokkaido | Hokkaido Citizens Activites Center (Kaderu 2.7) | [Poster Presentation]
An Efficient Branch-and-Bound Algorithm for Submodular Function Maximization Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara (Osaka Univ./RIKEN) IBISML2018-68 |
The submodular function maximization is an attractive optimization model that appears in many real applications. Altho... [more] |
IBISML2018-68 pp.183-190 |
| SR | 2018-10-31 13:25 |
Overseas | Mandarin Hotel, Bangkok, Thailand | [Poster Presentation]
Efficient channel allocation for Citizens broadband radio service/spectrum access system Ryo Sato, Kenta Umebayashi (TUAT), K. B. Shashika Manosha (UoO) SR2018-89 |
Citizens Broadband Radio Service (CBRS) system is the three-tier spectrum sharing systems which consists of incumbent us... [more] | SR2018-89 pp.83-84 |
| RECONF, CPSY, DC, IPSJ-ARC (Joint) [detail] |
2017-05-23 10:55 |
Hokkaido | Noboribetsu-Onsen Dai-ichi-Takimoto-Kan | Power Optimization for Pipelined CGRA with Intger Linear Program Takuya Kojima, Naoki Ando, Hayate Okuhara, Ng.Doan Anh Vu, Hideharu Amano (Keio Univ.) RECONF2017-16 |
(To be available after the conference date) [more] | RECONF2017-16 pp.81-86 |
| COMP, IPSJ-AL | 2017-05-13 14:30 |
Nagasaki | Automatic Drawing for Metro Maps in Tokyo Masahiro Onda, Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2017-10 |
Metro maps are useful tools for passengers of complex city transportation networks.It is hrad to draw complex metro maps... [more] | COMP2017-10 pp.69-76 |
|
| CS | 2016-07-07 15:00 |
Okinawa | Miyakojima Hirara-kou terminal bldg. | [Invited Talk]
A study on automatic design algorithms for mobile fronthaul network Naoki Agata (KDDI), Naoya Nishi, Shinobu Nanba, Kosuke Nishimura (KDDI Labs.) CS2016-20 |
It is required that the number of BBUs is relatively minimized in the mobile fronthaul design from the view point of dep... [more] | CS2016-20 pp.55-60 |
| AI | 2015-12-19 09:20 |
Okinawa | Resource Allocation with Preference Order and Effective Allocation Methods Kengo Saito, Toshiharu Sugawara (Waseda Univ.) AI2015-46 |
This paper introduces a resource allocation problem with agents' preference orders and proposes efficient algorithms ... [more] |
AI2015-46 pp.119-124 |
|
| SIP, RCS | 2015-01-23 09:15 |
Okayama | Okayama Univ. | An Accelerated design of FIR Filters with CSD Coefficient based on Branch and Bound Method using GPU Jun Osima, Yosuke Sugiura, Naoyuki Aikawa (TUS) SIP2014-100 RCS2014-288 |
In this paper，we study a design method for FIR filter with Canonic Signed-Digit(CSD) coefficient by using Graphics Proce... [more] | SIP2014-100 RCS2014-288 pp.113-116 |
| MSS | 2014-03-06 16:45 |
Ehime | Ehime Univ. | A Numerical Study on Optimality of Elevator Operations by a Zoning Technique Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi (Ehime Univ.) MSS2013-82 |
In this study, some preliminary results on optimality of elevator operations by a zoning technique are displayed. Thi... [more] |
MSS2013-82 pp.43-48 |
| MSS, CAS, IPSJ-AL [detail] | 2013-11-07 14:00 |
Iwate | Hybrid CP/MIP Method for Car Control and Assignment Problem in Mce Systems Tatsuya Minegishi, Toshiyuki Miyamoto (Osaka Univ.) CAS2013-67 MSS2013-46 |
As the height of buildings grows, the demand of enhancing transportation capability in buildings has been increasing.If ... [more] | CAS2013-67 MSS2013-46 pp.129-134 |
|
| COMP | 2013-09-03 10:45 |
Tottori | A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2013-26 |
Permutation bandit problem is a kind of combinatorial multi-armed bandit problem in which an $M$-permutation of $N$ elem... [more] | COMP2013-26 pp.9-16 |
|
[Return to Top Page]