CiNii Articles - Binary decision diagram

1

The Multiple Representation of Protein Sequence MotifsUsing Sequence Binary Decision Diagrams [in Japanese]

YAMATO Kohei , KATO Hiroaki , KATSURAGI Tetsuo , TAKAHASHI Yoshimasa

… In this paper, we describe a multiple representation method of protein sequence motifs using sequence binary decision diagrams (SeqBDDs) and their application for motif search. …

Journal of Computer Chemistry, Japan 19(1), 8-17, 2020

J-STAGE
2

Simulated Annealing Method for Relaxed Optimal Rule Ordering

HARADA Takashi , TANAKA Ken , MIKAWA Kenji

… However, using a zero-suppressed binary decision diagram (ZDD), we can determine it in a reasonable amount of time. …

IEICE Transactions on Information and Systems E103.D(3), 509-515, 2020

J-STAGE
3

A Note on Moment-Based Approximation for Uncertainty Propagation in Hierarchical Models

張家豪 , 鄭俊俊 , 岡村寛之 , 土肥正

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(315), 1-6, 2019-11-28
4

BDD Method for Evaluating Reliability of Traffic-Path-Based Network Model

Takuto Koizum , Masahiro Hayashi

IEICE Proceeding Series (59), P3-9, 2019

DOI
5

BDD Method for Evaluating Reliability of Traffic-Path-Based Network Model

Takuto Koizum , Masahiro Hayashi

IEICE Proceeding Series (56), P3-9, 2019

DOI
6

Methods for Reducing Power and Area of BDD-Based Optical Logic Circuits

MATSUO Ryosuke , SHIOMI Jun , ISHIHARA Tohru , ONODERA Hidetoshi , SHINYA Akihiko , NOTOMI Masaya

… However, existing methods for synthesizing optical circuits mostly rely on straight-forward mappings from established data structures such as Binary Decision Diagram (BDD). …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(12), 1751-1759, 2019

J-STAGE
7

Boosting over non-deterministic ZDDs

Fujita Takahiro , Hatano Kohei , Takimoto Eiji

… As a _rst step toward this approach, we consider a variant of the Zero-Suppressed Binary Decision Diagram (ZDD) as the data structure for representing the training data, which is a generalization of the ZDD by incorporating non-determinism. …

Theoretical computer science, 2018-12-04

IR
8

DenseZDD : A Compact and Fast Index for Families of Sets

Denzumi Shuhei , Kawahara Jun , Tsuda Koji , Arimura Hiroki , Minato Shin-ichi , Sadakane Kunihiko

Algorithms 11(8), a11080128, 2018-08

IR
9

Boosting over non-deterministic ZDDs

Fujita Takahiro , Hatano Kohei , Takimoto Eiji

… As the first step, we consider a variant of the Zero-Suppressed Binary Decision Diagram (ZDD) as the data structure for representing the training data, which is a generalization of the ZDD by incorporating non-determinism. …

2018-03

IR
10

Fast Enumeration of All Pareto-Optimal Solutions for 0-1 Multi-Objective Knapsack Problems Using ZDDs

SUZUKI Hirofumi , MINATO Shin-ichi

… Our algorithm is based on dynamic programming techniques using an efficient data structure called zero-suppressed binary decision diagram (ZDD), which handles a set of combinations compactly. …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A(9), 1375-1382, 2018

J-STAGE
11

Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints

NAKAHATA Yu , KAWAHARA Jun , HORIYAMA Takashi , KASAHARA Shoji

… The algorithm not only obtains a single partition but also enumerates all partitions simultaneously satisfying the above complex constraints, which is difficult to be treated by existing algorithms, using zero-suppressed binary decision diagrams …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A(9), 1363-1374, 2018

J-STAGE
12

Construction of Strategy using Binary Decision Diagram in Stock Investment using Technical Indicators [in Japanese]

KATO Ohki , ANADA Hazime

In recent year, many researchers pay attention to stock trading using technical analysis. In the investment using technical analysis, we predict future price movements from patterns of past p …

Proceedings of the Annual Conference of JSAI JSAI2018(0), 2J204-2J204, 2018

J-STAGE
13

BDDによるネットワーク信頼性の近似計算 (データ工学) [in Japanese]

佐々木勇和 , 藤原靖宏 , 鬼塚真

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(374), 85-90, 2017-12-22
14

On network reliability with link failure dependencies using BDDs [in Japanese]

吉田拓弥 , 川原純 , 井上武 , 笠原正治

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(301), 75-81, 2017-11-16
15

On network reliability with link failure dependencies using BDDs [in Japanese]

吉田拓弥 , 川原純 , 井上武 , 笠原正治

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(300), 75-81, 2017-11-16
16

Fast Computation of Lower Bounds for Privacy Evaluations, Based on Binary Decision Diagrams [in Japanese]

竹内聖悟 , 草野光亮 , 佐久間淳 , 津田宏治

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(293), 193-200, 2017-11-09
17

Efficient Adversarial Combinatorial Bandit Algorithm via Zero-suppressed Decision Diagrams [in Japanese]

坂上晋作 , 石畠正和 , 湊真一

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(110), 43-48, 2017-06-23
18

Optimization of Parallel Prefix Adder Using Simulated Annealing [in Japanese]

本敬之 , 金子峰雄

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116(478), 139-144, 2017-03-01
19

Optimization of grouping for Wind-Photovoltaic-Battery Hybrid System using Zero-suppressed binary decision diagram [in Japanese]

Takeda Kengo , Sawada Kenji , Shin Seiichi

Proceedings of the Japan Joint Automatic Control Conference 60(0), 142-149, 2017

J-STAGE
20

BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems

TAKEUCHI Fumito , NISHINO Masaaki , YASUDA Norihito , AKIBA Takuya , MINATO Shin-ichi , NAGATA Masaaki

… There exists a previous work that uses binary decision diagrams (BDDs) to represent the logical constraints, and traverses the input DAG and the BDD simultaneously. …

IEICE Transactions on Information and Systems E100.D(12), 2945-2952, 2017

J-STAGE

Search Results 1-20 of 432

Related Authors

Related Journals