| 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 |
| 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 |
|
| 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 |
| 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 |
| 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 |
| 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 |
| SIP, WBS | 2006-07-21 10:20 |
Niigata | Nagaoka Univ. of Tech. | Optimal Power Control of IDMA Systems Mark s. k. Lau, Wuyi Yue (Konan Univ.), Li Ping, Duan Li (Univ. of Hong Kong) |
This paper proposes a new formulation for the power allocation problem of an IDMA system. The problem is to minimize the... [more] | SIP2006-56 WBS2006-20 pp.13-18 |
| COMP | 2005-09-15 15:10 |
Osaka | Osaka Univ., Toyonaka Campus | An algorithm for generating vertex sequences to extract maximum weight cliques quickly Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the ... [more] |
COMP2005-33 pp.39-42 |
| COMP | 2005-04-18 11:10 |
Hyogo | Kwansei Gakuin Univ. | Branch-and-Bound Algorithms for MAX-2-SAT Yuichi Koga, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) |
MAX-2-SAT is one of the representative combinatorial problems and it is known to be NP-hard. It is stated as follows: Gi... [more] | COMP2005-3 pp.15-24 |
| IE, SIP, ICD, IPSJ-SLDM | 2004-10-22 15:50 |
Yamagata | Bus architecture optimization method for IP-based design Kyoko Ueda, Keishi Sakanushi, Noboru Yoneoka, Yoshinori Takeuchi, Masaharu Imai (Osaka Univ.) |
In IP-based design, to find the optimal bus architecture is very important problem because bus architecture strongly aff... [more] | SIP2004-101 ICD2004-133 IE2004-77 pp.73-78 |
|
[Return to Top Page]