IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 16 of 16  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
HWS, VLD 2023-03-01
16:25
Okinawa
(Primary: On-site, Secondary: Online)
Large-scale SAT Solution Search by FPGA Implementation of Attraction-Repulsion Control-Type Amoeba Algorithm
Hideharu Amano, Torao Okuyama (Keio Univ.), Kaori Okoda, Masashi Aono (Amoeba Energy) VLD2022-82 HWS2022-53
(To be available after the conference date) [more] VLD2022-82 HWS2022-53
pp.55-60
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
VLD, HWS [detail] 2022-03-07
16:20
Online Online AmoebaSAT-based Efficient Accelerator for Autonomous Driving Application
Yusuke Inuma, Yuko Hara-Azumi (Tokyo Tech) VLD2021-90 HWS2021-67
(To be available after the conference date) [more] VLD2021-90 HWS2021-67
pp.75-80
DC 2021-12-10
14:20
Kagawa
(Primary: On-site, Secondary: Online)

Kyozo Hida, Tatsuhiro Tsuchiya (Osaka Univ) DC2021-58
This paper addresses the problem of finding the set of the most vulnerable nodes in interdependent networks where initia... [more] DC2021-58
pp.19-23
COMP 2019-12-13
11:15
Gunma Ikaho Seminar House, Gunma University Computational complexity of satisfiability problem with exact number of solutions
Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) COMP2019-34
Valiant and Vazirani proved the isolation lemma for SAT to show a polynomial-time randomized reduction from SAT to Uniqu... [more] COMP2019-34
pp.39-43
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
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
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM
(Joint) [detail]
2012-11-27
13:00
Fukuoka Centennial Hall Kyushu University School of Medicine Effective Orderings of Instances and Variable Assignments in SAT-based ATPG with Solution Reuse
Kenji Ueda, Tsuyoshi Iwagaki, Hideyuki Ichihara, Tomoo Inoue (Hiroshima City Univ.) VLD2012-83 DC2012-49
This report discusses the efficiency of iteratively solving various instances with
solution reuse in test generation ba... [more]
VLD2012-83 DC2012-49
pp.141-146
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
AI 2006-05-18
11:10
Tokyo Kikai-Shinko-Kaikan Bldg. Effective SAT Planning and SAT Scheduling by Lemma Reusing
Hidetomo Nabeshima (Univ. of Yamanashi), Takehide Soh (Kobe Univ.), Katsumi Inoue (NII), Koji Iwanuma (Univ. of Yamanashi)
In this paper, we propose a new approach, called {\itshape lemma-reusing}, for accelerating SAT based planning and sched... [more] AI2006-4
pp.19-24
 Results 1 - 16 of 16  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan