Results 11 to 20 of about 3,622,400 (195)

A Kamm’s Circle-Based Potential Risk Estimation Scheme in the Local Dynamic Map Computation Enhanced by Binary Decision Diagrams [PDF]

open access: yesSensors, 2022
Autonomous vehicles (AV) are a hot topic for safe mobility, which inevitably requires sensors to achieve autonomy, but relying too heavily on sensors will be a risk factor.
Arvind Kumar, Hiroaki Wagatsuma
doaj   +2 more sources

Reliability Dynamic Analysis by Fault Trees and Binary Decision Diagrams

open access: yesInformation, 2020
New wind turbines are becoming more complex and reliability analysis of them rising in complexity. The systems are composed of many components. Fault tree is used as an useful tool to analyze these interrelations and provide a scheme of the wind turbine,
Fausto Pedro García Márquez   +3 more
doaj   +3 more sources

Reliability Analysis of Noncoherent Systems by Logical Differential Calculus and Binary Decision Diagrams

open access: yesCommunications, 2014
Reliability is the important characteristic of systems. Most of the systems consist of more than one component. Moreover, modern systems are very complex and they include a lot of components. Therefore, effective methods have to be developed for analysis
Jozef Kostolny   +2 more
doaj   +2 more sources

Compressing Binary Decision Diagrams

open access: yes, 2008
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node.
Hansen, Esben Rune   +2 more
core   +5 more sources

Optimization Bounds from Binary Decision Diagrams

open access: yesINFORMS Journal on Computing, 2014
We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0-1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in ...
André Augusto Cire   +2 more
exaly   +3 more sources

Learning ordered binary decision diagrams

open access: yes, 1995
We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output ...
Gavaldà Mestre, Ricard   +1 more
openaire   +3 more sources

Study of gold-based alloy phase diagrams [PDF]

open access: yes, 1990
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The partial constitutions of the Au-Ge-X and Au-Pb-X ternary alloys have been investigated, where X is a metallic element, selected from the sub-groups ...
Butt, M Taqi Zahid
core   +7 more sources

Automated Parallel Test Forms Assembly using Zero-suppressed Binary Decision Diagrams

open access: yesIEEE Access, 2023
Recently, through the progress achieved in the study of computer science, automated test assemblies of parallel test forms, for which each form has equivalent measurement accuracy but with a different set of items, have emerged as a new standard tool. An
Kazuma Fuchimoto   +2 more
doaj   +1 more source

Practical Data-in-Use Protection Using Binary Decision Diagrams

open access: yesIEEE Access, 2020
Protection of data-in-use, contrary to the protection of data-at-rest or data-in-transit, remains a challenge. Cryptography advances such as Fully Homomorphic Encryption (FHE) provide theoretical, albeit impractical, solutions to functionally-complete ...
Oleg Mazonka   +4 more
doaj   +1 more source

Equational Binary Decision Diagrams [PDF]

open access: yes, 2007
We allow equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of reduced ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQOBDDs satisfiability and tautology checking can be done in constant time.
J.F. Groote (Jan Friso)   +1 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy