| 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 # | |
| R | 2023-03-10 16:15 |
Hiroshima | (Primary: On-site, Secondary: Online) |
Proposal for Obtaining Optimal Arrangement of the 3-dimensional-consecutive-(r1,r2,r3)-out-of-(n1,n2,n3):F system Tomoaki Akiba (Chiba IT)  R2022-55 |
In this study, we consider the component assignment problem of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of- (n_1,... [more] | R2022-55 pp.41-46 |
| CAS, MSS, IPSJ-AL [detail] | 2019-11-29 09:45 |
Fukuoka | Exact Algorithm for Sorting Rules in Firewall Ryosuke Fumiiwa, Toshinori Yamada (Saitama Univ.) CAS2019-55 MSS2019-34 |
Given a firewall policy(a sequence of packet rules), the sorting problem of rules in a firewall is to sort the rules in ... [more] | CAS2019-55 MSS2019-34 pp.73-78 |
|
| 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 |
| R | 2018-07-27 14:50 |
Hokkaido | Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system Taishin Nakamura, Hisashi Yamamoto (Tokyo Met. Univ.), Takashi Shinzato (Tamagawa Univ.) R2018-13 |
One of the most significant problems in reliability theory is an optimal arrangement problem on the assumption that comp... [more] | R2018-13 pp.13-18 |
|
| CQ, MVE, IE, IMQ (Joint) [detail] |
2018-03-08 14:10 |
Okinawa | Okinawa Industry Support Center | Efficient orthogonalization method for eigenvectors of the Laplacian matrix for estimation of social network structure Naoki Hirakura (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) CQ2017-111 |
The network resonance method enable us to observe partial information of eigenvalues and eigenvectors that describe the ... [more] | CQ2017-111 pp.45-50 |
| IT | 2015-09-04 14:50 |
Ishikawa | Hakusan Shobutei | On decoding of Polar codes using search algorithm Akira Kamatsuka, Toshiyasu Matsushima (Waseda Univ.) IT2015-43 |
Polar codes and successive cancelation (SC) decoding was proved to achieve capacity on binary discrete memoryless symmet... [more] | IT2015-43 pp.55-60 |
| 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 |
| CAS, MSS, IPSJ-AL [detail] | 2014-11-20 16:10 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki island) | Optimization of Unit Commitment Problem by distributed simplex algorithm Toshiki Asai, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) CAS2014-96 MSS2014-60 |
The unit commitment problem determines a turn-on and turn-off scheduling and outputs of power generating units to meet a... [more] | CAS2014-96 MSS2014-60 pp.75-79 |
| IPSJ-SLDM, CPSY, RECONF, VLD [detail] | 2014-01-28 08:55 |
Kanagawa | Hiyoshi Campus, Keio University | A Unified Software/Reconfigurable Hardware Approach to Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) VLD2013-103 CPSY2013-74 RECONF2013-57 |
We propose an algorithm to solve the maximum clique problem of large graphs. The proposed algorithm is a unified softwar... [more] | VLD2013-103 CPSY2013-74 RECONF2013-57 pp.7-12 |
| COMP | 2013-03-18 15:15 |
Gifu | Gifu University | A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] | COMP2012-59 pp.47-53 |
| SIP, CAS, CS | 2013-03-15 11:35 |
Yamagata | Keio Univ. Tsuruoka Campus (Yamagata) | A Branch-and-Bound Placement Method on Overlapped Printed Wiring Boards Tetsuya Matsuura, Kunihiro Fujiyoshi (Tokyo Univ. of Agriculture and Tech.) CAS2012-124 SIP2012-155 CS2012-130 |
In undersized manufacturing products, some PWBs (Printed Wiring Boards) are installed with overlapping. The distance bet... [more] | CAS2012-124 SIP2012-155 CS2012-130 pp.163-168 |
| HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto | Kumamoto-Shintoshin-plaza | Personalized Estimation of Musical Emotion using User Profiles Yasunori Iwatsuki, Shinji Sako, Tadashi Kitamura (NIT) |
This paper proposes a learning method of musical emotion models for unknown users. Considering emotional personality is ... [more] | |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-28 10:30 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | A Hardware Algorithm Using Dynamically Partially Reconfigurable FPGAs for Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) RECONF2012-53 |
In this paper, we propose a hardware algorithm to solve the maximum clique problem of large graphs, and show its impleme... [more] | RECONF2012-53 pp.33-38 |
| IBISML | 2011-11-09 15:45 |
Nara | Nara Womens Univ. | Prismatic algorithm for discrete D.C. programming problem Yoshinobu Kawahara, Takashi Washio (Osaka Univ.) IBISML2011-56 |
In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), {\... [more] | IBISML2011-56 pp.93-98 |
| CS, SIP, CAS | 2011-03-04 14:10 |
Okinawa | Ohhamanobumoto memorial hall (Ishigaki)( | [Poster Presentation]
A Study on Initial Solution for Designing CSD Coefficient FIR Filters using Branch and Bound Method Nobuo Takahashi, Kenji Suyama (Tokyo Denki Univ.) CAS2010-165 SIP2010-181 CS2010-135 |
In this paper, we study a selecting way of an initial solution for a fast design of FIR filters with CSD coefficients. T... [more] | CAS2010-165 SIP2010-181 CS2010-135 pp.369-374 |
| VLD | 2011-03-02 13:10 |
Okinawa | Okinawaken-Danjo-Kyodo-Sankaku Center | An Architecture Exploration Method based on a Branch-and-Bound Strategy for Embedded VLIW Processors Kohei Aoki, Ittetsu Taniguchi, Hiroyuki Tomiyama, Masahiro Fukui (Ritsumeikan Univ.) VLD2010-116 |
This paper proposes an architecture exploration method based on a branch-and-bound strategy for embedded VLIW processors... [more] | VLD2010-116 pp.1-6 |
| MSS | 2009-01-30 09:30 |
Kanagawa | Kanagawa Industrial Promotion Center | VNS-based Enhancing of a Distributed Branch-and-Bound Algorithm ParaBSC for the Graph Coloring Problem Yukihiro Dougo, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-52 |
Given an undirected graph $G$, a coloring is an assignment of colors to vertices of $G$ such that any pair of adjacent... [more] |
CST2008-52 pp.61-66 |
| PRMU | 2009-01-12 10:45 |
Tokyo | NII | Effective Face Recognition by Branch and Bound Method Yuta Matsumoto, Yuzuko Utsumi, Yoshio Iwai (Osaka Univ.) PRMU2008-195 |
Many image features have been used for face recognition in recent decades. We propose a effective method for face recog... [more] | PRMU2008-195 pp.37-42 |
| CAS | 2008-01-31 13:25 |
Okinawa | Enhancing Algorithms for the Graph Coloring Problem Shinji Okada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-85 |
Coloring a given graph $G=(V,E)$ is to assign each vertex $v$ of $V$ a color $c(v)$ such that $c(u)$ is different from $... [more] | CAS2007-85 pp.7-12 |
|
| MSS | 2008-01-28 11:00 |
Tokushima | The University of Tokushima | Branch and Bound Approach for Multi-Car elevator Control Yoshiyuki Tsuchie, Ayako Suzuki, Naoki Hayashi (Osaka Univ.) CST2007-37 |
This paper considers a scheduling algorithm for multi-car elevators. In a multi-car elevator scheduling problem, it is a... [more] | CST2007-37 pp.13-16 |
[Return to Top Page]