| 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 # | |
| IT | 2023-08-04 11:25 |
Kanagawa | Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Constructing Visual Cryptography Schemes for Multiple Images Using SAT Technology Tako Hiroaki (Univ. Yamanashi), Xiao-Nan Lu (Gifu Univ.), Nabeshima Hidetomo (Univ. Yamanashi)  IT2023-25 |
The visual cryptography scheme (VCS) is a type of secret sharing scheme for images.The VCS uses matrices called basis ma... [more] | IT2023-25 pp.62-67 |
| KBSE, SWIM | 2022-05-20 14:00 |
Tokyo | (Primary: On-site, Secondary: Online) |
Generating LTL formulas with Trace Examples Kota Komatsu, Hiroki Horita (Ibaraki Univ.) KBSE2022-1 SWIM2022-1 |
In declarative process mining, a user can verify a desired property in a business process by providing an LTL formula wi... [more] | KBSE2022-1 SWIM2022-1 pp.1-6 |
| KBSE | 2018-03-02 15:20 |
Okinawa | A Constraint Optimization Method for Cloud Service Composition Shridhar Choudhary, Kosaku Kimura, Atsuji Sekiguchi (FLL) KBSE2017-51 |
With advent of multiple cloud services with similar functionalities, selecting cloud services for a composite cloud serv... [more] | KBSE2017-51 pp.73-77 |
|
| COMP | 2016-10-21 14:00 |
Miyagi | Tohoku University | An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits. Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII) COMP2016-27 |
A Boolean function $f: bits{n} to bit$ is {em weighted symmetric} if there exist a function $g: mathbb{Z} to bit$ and i... [more] |
COMP2016-27 pp.29-34 |
| SS | 2016-03-10 10:50 |
Okinawa | An extension of SQL for specifying combinatorial optimization problems Yusaku Uchida, Masahiko Sakai, Naoki Nishida (Nagoya Univ.) SS2015-80 |
The performance of satisfiability (SAT) solvers have incredibly improved in recent years. It is, however, difficult to ... [more] |
SS2015-80 pp.25-30 |
|
| SDM, ED | 2015-02-06 11:55 |
Hokkaido | Hokkaido Univ. | Electronic circuit implementation of amoeba-inspired solution search algorithm for optimization problems Ryo Wakamiya, Seiya Kasai (Hokkaido Univ.), Masashi Aono (Tokyo Inst. of Tech.), Makoto Naruse (NICT), Hiroyoshi Miwa (Kwansei Gakuin Univ.) ED2014-152 SDM2014-161 |
It is known that amoeba has computational ability on the basis of its self-organized movements in spite of simple struct... [more] | ED2014-152 SDM2014-161 pp.81-85 |
| MSS, SS | 2015-01-27 09:20 |
Tottori | A supervisor synthesis by MaxSAT solvers under partial observation Tatsuki Hirota, Shoji Yuen (Nagoya Univ), Tetsuya Tohdo (DENSO) MSS2014-82 SS2014-46 |
Synthesis of the supervisor for discrete event systems under partial observation has been shown exponen- tial in princi... [more] |
MSS2014-82 SS2014-46 pp.79-84 |
|
| SS | 2014-10-24 10:30 |
Kochi | Kochi city culture-plaza cul-port | Deriving supremal controllable sub-specifications in discrete event systems using MaxSAT solvers. Tatsuki Hirota, Shoji Yuen (Nagoya Univ), Tetsuya Tohdo (DENSO) SS2014-31 |
A discrete event system, DES for short, makes state transitions by discrete occurrences of events.System behavior is mod... [more] | SS2014-31 pp.35-40 |
| DC | 2014-02-10 10:55 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Low Power Dissipation Oriented Don't Care Filling Method Using SAT Yoshiyasu Takahashi, Hiroshi Yamazaki, Toshinori Hosokawa (Nihon Univ.), Masayoshi Yoshimura (Kyushu Univ) DC2013-83 |
High power dissipation can occur by high launch-induced switching activity when the response to a test pattern is captur... [more] | DC2013-83 pp.25-30 |
| COMP | 2013-12-20 15:30 |
Okinawa | Okinawa Industry Support Center | [Tutorial Lecture]
Introduction to Computational Complexity Theory (5): Approaches to P vs. NP via Circuits Kazuhisa Seto (Seikei Univ.) COMP2013-47 |
In this talk, we give a brief introduction to Circuit Complexity and Circuit Satisfiability Problems. At first, we prov... [more] | COMP2013-47 p.57 |
| CAS, MSS | 2011-11-17 14:50 |
Yamaguchi | Univ. of Yamaguchi | On some algorithm to verify trap ccontaining circuit nets. Atsushi Ohta, Kohkichi Tsuji (Aichi Pref. Univ.) CAS2011-68 MSS2011-37 |
Petri net is a graphical and mathematical modeling tool for concurrent systems. Analysis of general Petri net requires ... [more] |
CAS2011-68 MSS2011-37 pp.25-30 |
| PRMU, IBISML, IPSJ-CVIM [detail] | 2011-09-06 15:20 |
Hokkaido | Visualization of the Phase Transition Phenomena on K-satisfiability Problem through Principal Component Analysis Yasuaki Akazawa (Waseda Univ.), Masato Okada (Univ. Tokyo), Masato Inoue (Waseda Univ.) PRMU2011-78 IBISML2011-37 |
In this manuscript, we study about the random K-satisfiability (K-SAT) problem through numerical simulation. K-SAT probl... [more] | PRMU2011-78 IBISML2011-37 pp.165-172 |
|
| DC, CPSY (Joint) |
2011-07-28 16:15 |
Kagoshima | A Parallel Extended SAT Solver for Cardinality Constraints XiaoJuan Xu, Yuji Yamane, Kazunori Ueda (Waseda Univ.) DC2011-17 |
Cardinality constraints generated from real-world problems are often a bottleneck of SAT solving. This paper proposes an... [more] | DC2011-17 pp.13-18 |
|
| COMP | 2011-04-22 15:15 |
Kyoto | Kyoto University | Computation of quantifier elimination of linear inequlities of first order predicate logic Yuuki Ono, Satoshi Yamane (Kanazawa Univ.) COMP2011-8 |
In this paper, the algorhithm of quantifier elimination of first-order predicate logic for linear inequalities will be d... [more] | COMP2011-8 pp.55-59 |
| VLD | 2009-03-12 10:30 |
Okinawa | A Formal Verification Method for On-Chip Programmable Interconnect Takaaki Tagawa, Hiroaki Yoshida, Masahiro Fujita (Univ. of Tokyo) VLD2008-142 |
As the development cost increases, programmable devices such as FPGAs are becoming critically important. A key componen... [more] | VLD2008-142 pp.95-100 |
|
| SS | 2007-12-17 17:00 |
Shimane | Shimane Univ. | A tool for designing Sudoku problems by interactive fill-in approach Yohei Umano, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Uni.) SS2007-50 |
In recent years, efficient SAT solvers, which decide satisfiability of boolean formulae, have been developed and used in... [more] | SS2007-50 pp.73-78 |
| 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 |
[Return to Top Page]