| 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 # | |
| COMP, IPSJ-AL | 2024-05-09 11:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.) |
[more] | |
| COMP | 2023-03-02 11:00 |
Tokyo | Ochanomizu University | Finding Forcing on ZDD by Dynamic Programming Takashi Harada, Shogo Takeuchi (Kochi Univ. of Tech.)  COMP2022-33 |
Exact cover problem takes a set S and a subset F of the power set of S as an input and determines whether there exists a... [more] | COMP2022-33 pp.1-6 |
| CPSY, DC, IPSJ-ARC (Joint) [detail] |
2016-08-10 18:30 |
Nagano | Kissei-Bunka-Hall (Matsumoto) | Regularly Edge-added Torus Graphs with the Minimum Diameter and the Minimum Average Shortest Path Length Hiroyuki Kobayashi, Noriyuki Fujimoto (Osaka Prefecture Univ.) CPSY2016-40 |
It is not realistic to connect all of cores in a multicore-processor each other because current multicore-processors hav... [more] | CPSY2016-40 pp.287-292 |
| NC, NLP (Joint) |
2016-01-29 10:55 |
Fukuoka | Kyushu Institute of Technology | Exact Optimization Method for Radio Resource Allocation in MIMO-OFDM System Takahiro Mitsuoka, Thong Huynh, Kaori Kuroda, Mikio Hasegawa (Tokyo Univ. Science) NLP2015-138 |
High data rate is required to use rich application on mobile terminals. It is important to solve combinatorial optimizat... [more] | NLP2015-138 pp.69-73 |
| AP | 2013-08-30 15:00 |
Kanagawa | Yokosuka | Diffraction of an electromagnetic plane wave by a thick rectangular hole
-- Evaluation of the transmission coefficient for oblique incidences -- Hirohide Serizawa (Numazu National College of Tech.), Kohei Hongo AP2013-77 |
Transmission coefficients are calculated for various hole's sizes and screen's thicknesses and for several incident angl... [more] | AP2013-77 pp.83-88 |
| CAS | 2013-01-28 14:10 |
Oita | Beppu International Convention Center | On Improving Order of Element Factoring in Calculating Traffic-Path-Based Reliability of Networks Takeshi Noguchi, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ) CAS2012-74 |
In this study, we focus on a reliability evaluation model N in which communication capacity reflected propertis of real ... [more] | CAS2012-74 pp.47-51 |
| COMP | 2012-06-21 13:20 |
Hokkaido | Hokkaido University | A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis Kazuhisa Seto, Suguru Tamaki (Kyoto Univ.) COMP2012-17 |
We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis... [more] | COMP2012-17 pp.41-48 |
| COMP | 2007-10-16 13:30 |
Miyagi | Tohoku Univ. | An exact algorithm for #25SAT based on dynamic proframming on path decomposition Mitsuo Motoki (JAIST) COMP2007-43 |
In 2006, Fomin et al. proposed fast exponential-time exact algorithm for some graph problems. They combined branch-and-... [more] |
COMP2007-43 pp.13-17 |
| R | 2007-06-22 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A study on Efficient Algorithm for Solving Optimal Component Arrangement Problem of Circular Consecutive-k-out-of-n: F System Koji Shingyochi (Jumonji Univ.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2007-15 |
A Circular Consecutive-k-out-of-n: F system consists of n components arranged along a circular path. This system fails i... [more] | R2007-15 pp.7-12 |
| COMP | 2005-04-18 10:35 |
Hyogo | Kwansei Gakuin Univ. | Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.) |
We examine various strategies for exact approaches to the 2-dimensional strip packing problem (2SP) with and without rot... [more] | COMP2005-2 pp.5-14 |
[Return to Top Page]