| 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 # | |
| IE, ITE-ME, ITE-AIT [detail] | 2017-10-05 13:00 |
Nagasaki | Tsunami inundation forecast hazard map creation method which is easily updated using land cover analysis Nakanishi Hajime, Yoshida Hiromi, Iiguni Youji (Osaka Univ.)  IE2017-47 |
Information on the hazard is required to be up to date. However, the hazard map can not be updated frequently due to the... [more] | IE2017-47 pp.1-6 |
|
| RCC, ITS, WBS | 2015-12-17 10:30 |
Okinawa | Okinawa Industry Support Center | [Poster Presentation]
A study on the task assignment and routing algorithm in distribution warehouse considering interruption requests
-- Itterative application of Genetic Algorithm to deal with interruption requests -- Tsubasa Tamura, Takayoshi Yokota (Tottori Univ) WBS2015-45 ITS2015-17 RCC2015-47 |
In this paper, a new algorithm which combinatorial optimization problem for the optimum routing of the conveyance robot ... [more] | WBS2015-45 ITS2015-17 RCC2015-47 pp.37-42 |
| IA | 2014-11-06 10:20 |
Overseas | Thailand | IPTV Multicast Routing in SDN/OpenFlow Environments Pornnipa Rattanawadee (Chulalongkorn Univ.), Natchaphon Ruengsakulrach (Georgia Tech), Chaiyachet Saivichit (Chulalongkorn Univ.) IA2014-42 |
This paper proposes an application of SDN/OpenFlow with IPTV multicasting. In order to obtain an efficient IPTV service ... [more] | IA2014-42 pp.45-50 |
| CPSY, DC (Joint) |
2014-07-28 13:15 |
Niigata | Toki Messe, Niigata | An FPGA-based Graph Processing Accelerator with PyCoRAM Shinya Takamaeda-Yamazaki, Tadahiro Edamoto, Jun Yao, Yasuhiko Nakashima (NAIST) CPSY2014-10 |
In order to improve the programmablity of FPGA-based accelerators with higher performance, we are developing PyCoRAM tha... [more] | CPSY2014-10 pp.1-6 |
| CPSY, DC (Joint) |
2014-07-28 18:15 |
Niigata | Toki Messe, Niigata | Performance Evaluation of Speculative Parallel Processing Utilizing Hardware Transactional Memory on Commercial Multi-core CPU Yutaka Matsuno, Kanemitsu Ootsu, Takeshi Ohkawa, Takashi Yokota (Utsunomiya Univ.) CPSY2014-16 |
Recently, it becomes essential to use parallel computation utilizing thread level parallelism as a method to utilize a s... [more] | CPSY2014-16 pp.37-42 |
| COMP | 2012-03-16 14:10 |
Tokyo | Univ. of Tokyo | Sublinear Space Algorithm for Shortest Path Problem on Grid Graph Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) COMP2011-52 |
The shortest path problem is one of the most important problem in computer science and has many practical applications, ... [more] | COMP2011-52 pp.39-44 |
| VLD, CPSY, RECONF, IPSJ-SLDM [detail] | 2012-01-26 15:25 |
Kanagawa | Hiyoshi Campus, Keio University | Evaluation of Improvement Techniques for Placement and Routing on MPLD : a New Reconfigurable Device Ken Taomoto, Masato Inagi, Hideyuki Kawabata, Kazuya Tanigawa, Tetsuo Hironaka (Hiroshima City Univ), Masayuki Sato, Takashi Ishiguro (Taiyo Yuden), Toshiaki Kitamura, Masatoshi Nakamura (Hiroshima City Univ) |
(To be available after the conference date) [more] | |
| COMP | 2011-10-21 10:00 |
Miyagi | Tohoku Univ. | Memory-Constrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28 |
This paper presents a space-efficient algorithm for finding a shortest path in a grid graph whose size is $\sqrt{n}\tim... [more] |
COMP2011-28 pp.1-5 |
| ISEC, IT, WBS | 2008-02-29 14:55 |
Tokyo | Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-70 ISEC2007-167 WBS2007-101 |
We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational compl... [more] |
IT2007-70 ISEC2007-167 WBS2007-101 pp.141-146 |
|
[Return to Top Page]