| 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 | 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 |
| COMP | 2022-03-06 17:00 |
Online | Online | On Approximation of Power Bounded Degree Deletion Kento Mukae, Toshihiro Fujito (TUT) COMP2021-38 |
Bounded Degree Deletion (BDD) with degree bound $binmathbb{Z}$ is the problem of computing a minimum vertex set in ... [more] |
COMP2021-38 pp.36-41 |
| NC, NLP (Joint) |
2021-01-22 10:30 |
Online | Online | Formulation of Mindfulness states as a network optimization problem and an attempt to identify key brain regions using Digital Annealer Haruka Nakamura, Yoshimasa Tawatsuji, Tatsunori Matsui (Waseda Univ.), Makoto Nakamura, Koichi Kimura, Hisanori Fujisawa (Fujitsu Labs) NC2020-37 |
While many brain regions have been suggested to be involved in mindfulness, the mechanism of information propagation in ... [more] | NC2020-37 pp.29-33 |
| COMP | 2020-03-01 14:25 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
On Approximation Algorithms for Power Vertex Cover Problem Takumi Tatematsu, Tetsuro Rintani, Toshihiro Fujito (TUT) COMP2019-50 |
We present two 2-approximation algorithms for Power Vertex Cover problem, which is a generalization of the Vertex Cover... [more] |
COMP2019-50 pp.29-33 |
| ICD, CPSY, CAS | 2018-12-21 15:05 |
Okinawa | A Consideration of Method of Information Sources Terminals' Moving with Covering Problem on Epidemic Communication Mamoru Takano, Atsushi Kashiwabara, Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.), Masakazu Sengoku (Graduate Institute for Entrepreneurial Studies) CAS2018-82 ICD2018-66 CPSY2018-48 |
There is a study about location problem of information sources terminals, which is one of the previous studies on epidem... [more] | CAS2018-82 ICD2018-66 CPSY2018-48 pp.21-23 |
|
| ISEC, COMP | 2017-12-21 11:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Maximum k-path Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30 |
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] | ISEC2017-76 COMP2017-30 pp.25-31 |
| MSS | 2016-03-04 15:05 |
Yamaguchi | KAIKYO MESSE SHIMONOSEKI | Distributed Optimization of Data Transmission Path to Base Station for Voronoi Coverage Problems Naoto Ibuka, Takafumi Kanazawa (Osaka Univ.) MSS2015-85 |
The Voronoi coverage problem is to find the optimal position of multiple mobile sensors so as to cover the whole mission... [more] | MSS2015-85 pp.97-102 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 11:20 |
Hokkaido | Hokkaido University | Logit Dynamics Based Distributed Control Method for Voronoi Coverage Problems Naoto Ibuka, Takafumi Kanazawa (Osaka Univ.) CAS2014-6 VLD2014-15 SIP2014-27 MSS2014-6 SIS2014-6 |
The Voronoi coverage problem is to find the optimal position of multiple sensors so as to cover the whole mission space.... [more] | CAS2014-6 VLD2014-15 SIP2014-27 MSS2014-6 SIS2014-6 pp.29-32 |
| KBSE, SS, IPSJ-SE [detail] | 2014-07-11 13:10 |
Hokkaido | Furano-Bunka-Kaikan | On Coverage Criteria for State Transition Testing and Model Checker-Based Test Case Generation Cassia de Souza Carvalho, Tatsuhiro Tsuchiya (Osaka Univ.) SS2014-23 KBSE2014-26 |
State Transition Testing is an important category of software testing. Our work in progress focuses on a coverage crit... [more] |
SS2014-23 KBSE2014-26 pp.149-154 |
| PN | 2008-08-08 10:20 |
Hokkaido | Asari Classe Hotel | Network Reconfigure Algorithm for Power Consumption Yutaka Arakawa, Daisuke Ishii, Aya Tsurusaki, Naoaki Yamanaka, Hiroyuki Ishikawa (Keio Univ.), Kousuke Shiba (IPFlex) PN2008-16 |
New network reconfigure algorithm for low power consumption is proposed. Network is used minimum set of node and link wh... [more] | PN2008-16 pp.13-18 |
| NC | 2008-05-23 13:15 |
Ishikawa | Kanazawa Univ | [Invited Talk]
Algebraic topology and sensor networks Yasuaki Hiraoka (Hiroshima Univ.), Zin Arai (Kyoti Univ./JST), Kazunori Hayashi (Kyoti Univ.) NC2008-4 |
Wireless sensor network, which consists of a number of sensor nodes with signal processing and communication capabilit... [more] |
NC2008-4 pp.17-22 |
| DC | 2008-02-08 15:40 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Comparison of exact solutions and greedy solutions in static test compaction Kei Yagisawa, Koji Yamazaki (Meiji Univ.), Toshinori Hosokawa (Nihon Univ.), Hisao Tamaki (Meiji Univ.) DC2007-79 |
In this paper, we formulate static test compaction using don't cares as a minimum clique cover problem and a vertex colo... [more] | DC2007-79 pp.77-82 |
| CAS | 2008-02-01 16:20 |
Okinawa | Performance Comparison of Algorithms for the Minimum Weight Vertex Cover Problem Takuya Kunichika, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-107 |
A vertex cover of a given graph $G=(V,E)$ is a subset $N$ of $V$ such that $N$ contains either $u$ or $v$ for any edge $... [more] | CAS2007-107 pp.79-84 |
|
| RECONF, CPSY, VLD, IPSJ-SLDM | 2008-01-16 17:25 |
Kanagawa | Hiyoshi Campus, Keio University | Fast solution method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2 Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.), Kosuke Shiba (IPFlex) VLD2007-116 CPSY2007-59 RECONF2007-62 |
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor... [more] | VLD2007-116 CPSY2007-59 RECONF2007-62 pp.67-72 |
| 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 |
| PRMU | 2004-12-17 10:00 |
Oita | Nonparametric Classification by Covering Using Family of Minimum Enclosing Spheres Ichigaku Takigawa, Mineichi Kudo (Hokkaido Univ.) |
We propose a nonparametric multi-class classifier based on a family of spheres, each of which is the minimum covering sp... [more] | PRMU2004-140 pp.37-42 |
|
[Return to Top Page]