Gotowe bibliografie tematyczne / Reduced ordered binary decision diagram / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Reduced ordered binary decision diagram.

Artykuły w czasopismach na temat „Reduced ordered binary decision diagram”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Reduced ordered binary decision diagram”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Dvořák, Václav. "Bounds on Size of Decision Diagrams." JUCS - Journal of Universal Computer Science 3, no. (1) (1997): 2–22. https://doi.org/10.3217/jucs-003-01-0002.

Pełny tekst źródła
Streszczenie:
Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don t cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds is based on a bottom-up algorithm for constructing efficient ordered DDs developed by the author.
Style APA, Harvard, Vancouver, ISO itp.
2

Lai, Yong, Dayou Liu, and Shengsheng Wang. "Reduced ordered binary decision diagram with implied literals: a new knowledge compilation approach." Knowledge and Information Systems 35, no. 3 (2012): 665–712. http://dx.doi.org/10.1007/s10115-012-0525-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Prihozhy, Anatoly A. "Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (December 14, 2021): 84–97. http://dx.doi.org/10.33581/2520-6508-2021-3-84-97.

Pełny tekst źródła
Streszczenie:
The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered. It is one of the key problems being solved with the aim of creating quantum computing technology and quantum computers. A new method of stepwise transformation of the initial functional specification to a quantum circuit is proposed, which provides for the following project states: reduced ordered binary decision diagram, if-decision diagram, functional if-decision diagram, reversible circuit and quantum circuit. The novelty of the me
Style APA, Harvard, Vancouver, ISO itp.
4

Dong, Rongsheng, Yangyang Zhu, Zhoubo Xu, and Fengying Li. "Decision Diagram Based Symbolic Algorithm for Evaluating the Reliability of a Multistate Flow Network." Mathematical Problems in Engineering 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/6908120.

Pełny tekst źródła
Streszczenie:
Evaluating the reliability of Multistate Flow Network (MFN) is an NP-hard problem. Ordered binary decision diagram (OBDD) or variants thereof, such as multivalued decision diagram (MDD), are compact and efficient data structures suitable for dealing with large-scale problems. Two symbolic algorithms for evaluating the reliability of MFN, MFN_OBDD and MFN_MDD, are proposed in this paper. In the algorithms, several operating functions are defined to prune the generated decision diagrams. Thereby the state space of capacity combinations is further compressed and the operational complexity of the
Style APA, Harvard, Vancouver, ISO itp.
5

Das, Apangshu, Akash Debnath, and Sambhu Nath Pradhan. "Reduced ordered binary decision diagram-based combinational circuit synthesis for optimising area, power and temperature." International Journal of Nanoparticles 11, no. 2 (2019): 94. http://dx.doi.org/10.1504/ijnp.2019.099181.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pradhan, Sambhu Nath, Akash Debnath, and Apangshu Das. "Reduced ordered binary decision diagram-based combinational circuit synthesis for optimising area, power and temperature." International Journal of Nanoparticles 11, no. 2 (2019): 94. http://dx.doi.org/10.1504/ijnp.2019.10020325.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Radmanovic, Milos. "A study of binary decision diagram characteristics of bent Boolean functions." Facta universitatis - series: Electronics and Energetics 36, no. 2 (2023): 285–98. http://dx.doi.org/10.2298/fuee2302285r.

Pełny tekst źródła
Streszczenie:
Bent Boolean functions exist only for an even number of variables, moreover, they are unbalanced. Therefore, they are used in coding theory and in many areas of computer science. General form of bent functions is still unknown. One way of representing Boolean functions is with a reduced ordered binary decision diagram (ROBDD). The strength of ROBDDs is that they can represent Boolean functions data with a high level of redundancy in a compact form, as long as the data is encoded in such a way that the redundancy is exposed. This paper investigates characteristics of bent functions with focus o
Style APA, Harvard, Vancouver, ISO itp.
8

Ali, Muhammad Ali Rushdi, and Mohammad Alturki Alaa. "Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams." British Journal of Mathematics & Computer Science 22, no. 3 (2017): 1–9. https://doi.org/10.9734/BJMCS/2017/33642.

Pełny tekst źródła
Streszczenie:
A prominent reliability model is that of the partially-redundant (k-out-of-n) system. We use algebraic as well as signal-flow-graph methods to explore and expose the AR algorithm for computing k-out-of-n reliability. We demonstrate that the AR algorithm is, in fact, both a recursive and an iterative implementation of the strategy of Reduced Ordered Binary Decision Diagrams (ROBDDs). The underlying ROBDD for the AR recursive algorithm is represented by a compact Signal Flow Graph (SFG) that is used to deduce AR iterative algorithms of quadratic temporal complexity and linear spatial complexity.
Style APA, Harvard, Vancouver, ISO itp.
9

Wille, Robert, Görschwin Fey, and Rolf Drechsler. "Building free Binary Decision Diagrams using SAT solvers." Facta universitatis - series: Electronics and Energetics 20, no. 3 (2007): 381–94. http://dx.doi.org/10.2298/fuee0703381w.

Pełny tekst źródła
Streszczenie:
Free Binary Decision Diagrams (FBDDs) are a data structure for the representation of Boolean functions. In contrast to Ordered Binary Decision Diagrams (OBDDs) FBDDs allow different variable orderings along each path. Thus, FBDDs are the more compact representation while most of the properties of OBDDs are kept. However, how to efficiently build small FBDDs for a given function is still an open question. In this work we propose FBDD construction with the help of SAT solvers. "Recording" the single steps of a SAT solver during the search process leads to an FBDD. Furthermore, by exploiting appr
Style APA, Harvard, Vancouver, ISO itp.
10

Rushdi, Ali, and Alaa Alturki. "Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams." British Journal of Mathematics & Computer Science 22, no. 3 (2017): 1–9. http://dx.doi.org/10.9734/bjmcs/2017/33642.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

PRADHAN, SAMBHU NATH, and SANTANU CHATTOPADHYAY. "MULTIPLEXER-BASED MULTI-LEVEL CIRCUIT SYNTHESIS WITH AREA-POWER TRADE-OFF." Journal of Circuits, Systems and Computers 21, no. 05 (2012): 1250037. http://dx.doi.org/10.1142/s0218126612500375.

Pełny tekst źródła
Streszczenie:
Due to the regularity of implementation, multiplexers are widely used in VLSI circuit synthesis. This paper proposes a technique for decomposing a function into 2-to-1 multiplexers performing area-power tradeoff. To the best of our knowledge this is the first ever effort to incorporate leakage into power calculation for multiplexer-based decomposition. With respect to an initial ROBDD (reduced ordered binary decision diagram)-based representation of the function, the scheme shows more than 30% reduction in area, leakage and switching for the LGSynth91 benchmarks without performance degradation
Style APA, Harvard, Vancouver, ISO itp.
12

Newton, Jim, and Didier Verna. "A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams." ACM Transactions on Computational Logic 20, no. 1 (2019): 1–36. http://dx.doi.org/10.1145/3274279.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

K., V. B. V. Rayudu, Jahagirdar, and Srihari Rao P. "Modern design approach of faults (toggling faults,bridge faults and SAT) of reduced ordered binary decision diagram based on combo & sequential blocks." International Journal of Reconfigurable and Embedded Systems 9, no. 2 (2020): 158–68. https://doi.org/10.11591/ijres.v9.i2.pp158-168.

Pełny tekst źródła
Streszczenie:
In this Research we are going to develop ROBDD (Reduced Ordered Binary Decision Diagram) designs to detect toggling faults, bridge faults and SAT (Stuck at Fault), Here we are going to develop sequential blocks using ROBDD and applying to the mux to detect stuck at faults and also connecting the combo & Sequential blocks to find the toggling faults by connecting or using automatic test pattern generator. In this research we are going to develop the bridges between the blocks of ROBDD designs and converting them to and or logic to find the bridge faults of the design. Finding bridge and tog
Style APA, Harvard, Vancouver, ISO itp.
14

Vasantha Rayudu, Kurada Veera Bhoga, Jahagirdar Jahagirdar, and P. Rao. "Modern design approach of faults (toggling faults, bridge faults and SAT) of reduced ordered binary decision diagram based on combo & sequential blocks." International Journal of Reconfigurable and Embedded Systems (IJRES) 9, no. 2 (2020): 158. http://dx.doi.org/10.11591/ijres.v9.i2.pp158-168.

Pełny tekst źródła
Streszczenie:
In this Research we are going to develop ROBDD (Reduced Ordered Binary Decision Diagram) designs to detect toggling faults, bridge faults and SAT (Stuck at Fault), Here we are going to develop sequential blocks using ROBDD and applying to the mux to detect stuck at faults and also connecting the combo & Sequential blocks to find the toggling faults by connecting or using automatic test pattern generator. In this research we are going to develop the bridges between the blocks of ROBDD designs and converting them to and or logic to find the bridge faults of the design. Finding bridge and
Style APA, Harvard, Vancouver, ISO itp.
15

Li, Shunxin, Yinglei Song, and Yaying Zhang. "Combinatorial Test Case Generation Based on ROBDD and Improved Particle Swarm Optimization Algorithm." Applied Sciences 14, no. 2 (2024): 753. http://dx.doi.org/10.3390/app14020753.

Pełny tekst źródła
Streszczenie:
In applications of software testing, the cause–effect graph method is an approach often used to design test cases by analyzing various combinations of inputs with a graphical approach. However, not all inputs have equal impacts on the results, and approaches based on exhaustive testing are generally time-consuming and laborious. As a statute-based software-testing method, combinatorial testing aims to select a small but effective number of test cases from the large space of all possible combinations of the input values for the software to be tested, and to generate a set of test cases with a h
Style APA, Harvard, Vancouver, ISO itp.
16

Yan, Zongshuai, Chenhua Nie, Rongsheng Dong, Xi Gao, and Jianming Liu. "A Novel OBDD-Based Reliability Evaluation Algorithm for Wireless Sensor Networks on the Multicast Model." Mathematical Problems in Engineering 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/269781.

Pełny tekst źródła
Streszczenie:
The two-terminal reliability calculation for wireless sensor networks (WSNs) is a #P-hard problem. The reliability calculation of WSNs on the multicast model provides an even worse combinatorial explosion of node states with respect to the calculation of WSNs on the unicast model; many real WSNs require the multicast model to deliver information. This research first provides a formal definition for the WSN on the multicast model. Next, a symbolic OBDD_Multicast algorithm is proposed to evaluate the reliability of WSNs on the multicast model. Furthermore, our research on OBDD_Multicast construc
Style APA, Harvard, Vancouver, ISO itp.
17

Affum, Eric, Xiasong Zhang, Xiaofen Wang, and John Bosco Ansuura. "Efficient Lattice CP-ABE AC Scheme Supporting Reduced-OBDD Structure for CCN/NDN." Symmetry 12, no. 1 (2020): 166. http://dx.doi.org/10.3390/sym12010166.

Pełny tekst źródła
Streszczenie:
In line with the proposed 5th Generation network, content centric network/named data networking (CCN/NDN) has been offered as one of the promising paradigms to cope with the communication needs of future realistic network communications. CCN/NDN allows network communication based on content names and also allows users to obtain information from any of the nearest intermediary caches on the network. Due to that, the ability of cached content to protect itself is essential since contents can be cached on any node everywhere, and publishers may not have total control over their own published data
Style APA, Harvard, Vancouver, ISO itp.
18

Opara, Adam, and Dariusz Kania. "Decomposition-based logic synthesis for PAL-based CPLDs." International Journal of Applied Mathematics and Computer Science 20, no. 2 (2010): 367–84. http://dx.doi.org/10.2478/v10006-010-0027-1.

Pełny tekst źródła
Streszczenie:
Decomposition-based logic synthesis for PAL-based CPLDsThe paper presents one concept of decomposition methods dedicated to PAL-based CPLDs. The proposed approach is an alternative to the classical one, which is based on two-level minimization of separate single-output functions. The key idea of the algorithm is to search for free blocks that could be implemented in PAL-based logic blocks containing a limited number of product terms. In order to better exploit the number of product terms, two-stage decomposition and BDD-based decomposition are to be used. In BDD-based decomposition methods, fu
Style APA, Harvard, Vancouver, ISO itp.
19

Hawkins, P. J., V. Lagoon, and P. J. Stuckey. "Solving Set Constraint Satisfaction Problems using ROBDDs." Journal of Artificial Intelligence Research 24 (July 1, 2005): 109–56. http://dx.doi.org/10.1613/jair.1638.

Pełny tekst źródła
Streszczenie:
In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a str
Style APA, Harvard, Vancouver, ISO itp.
20

Xu, Zhiwu, Hongxu Chen, Alwen Tiu, Yang Liu, and Kunal Sareen. "A permission-dependent type system for secure information flow analysis." Journal of Computer Security 29, no. 2 (2021): 161–228. http://dx.doi.org/10.3233/jcs-200036.

Pełny tekst źródła
Streszczenie:
We introduce a novel type system for enforcing secure information flow in an imperative language. Our work is motivated by the problem of statically checking potential information leakage in Android applications. To this end, we design a lightweight type system featuring Android permission model, where the permissions are statically assigned to applications and are used to enforce access control in the applications. We take inspiration from a type system by Banerjee and Naumann to allow security types to be dependent on the permissions of the applications. A novel feature of our type system is
Style APA, Harvard, Vancouver, ISO itp.
21

Zhou, Feng, Hua Chen, and Limin Fan. "Prover - Toward More Efficient Formal Verification of Masking in Probing Model." IACR Transactions on Cryptographic Hardware and Embedded Systems 2025, no. 1 (2024): 552–85. https://doi.org/10.46586/tches.v2025.i1.552-585.

Pełny tekst źródła
Streszczenie:
In recent years, formal verification has emerged as a crucial method for assessing security against Side-Channel attacks of masked implementations, owing to its remarkable versatility and high degree of automation. However, formal verification still faces technical bottlenecks in balancing accuracy and efficiency, thereby limiting its scalability. Former tools like maskVerif and CocoAlma are very efficient but they face accuracy issues when verifying schemes that utilize properties of Boolean functions. Later, SILVER addressed the accuracy issue, albeit at the cost of significantly reduced spe
Style APA, Harvard, Vancouver, ISO itp.
22

Takenaga, Yasuhiko, and Shuzo Yajima. "Hardness of identifying the minimum ordered binary decision diagram." Discrete Applied Mathematics 107, no. 1-3 (2000): 191–201. http://dx.doi.org/10.1016/s0166-218x(99)00226-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Sistla, Meghana, Swarat Chaudhuri, and Thomas Reps. "Weighted Context-Free-Language Ordered Binary Decision Diagrams." Proceedings of the ACM on Programming Languages 8, OOPSLA2 (2024): 1390–419. http://dx.doi.org/10.1145/3689760.

Pełny tekst źródła
Streszczenie:
This paper presents a new data structure, called Weighted Context-Free-Language Ordered BDDs (WCFLOBDDs), which are a hierarchically structured decision diagram, akin to Weighted BDDs (WBDDs) enhanced with a procedure-call mechanism. For some functions, WCFLOBDDs are exponentially more succinct than WBDDs. They are potentially beneficial for representing functions of type B n → D , when a function’s image V ⊆ D has many different values. We apply WCFLOBDDs in quantum-circuit simulation, and find that they perform better than WBDDs on certain benchmarks. With a 15-minute timeout, the number of
Style APA, Harvard, Vancouver, ISO itp.
24

Wang, Ruiwei, and Roland H. C. Yap. "Encoding Multi-Valued Decision Diagram Constraints as Binary Constraint Trees." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (2022): 3850–58. http://dx.doi.org/10.1609/aaai.v36i4.20300.

Pełny tekst źródła
Streszczenie:
Ordered Multi-valued Decision Diagram (MDD) is a compact representation used to model various constraints, such as regular constraints and table constraints. It can be particularly useful for representing ad-hoc problem specific constraints. Many algorithms have been proposed to enforce Generalized Arc Consistency (GAC) on MDD constraints. In this paper, we introduce a new compact representation called Binary Constraint Tree (BCT). We propose tree binary encodings to transform any MDD constraint into a BCT constraint. We also present a specialized algorithm enforcing GAC on the BCT constraint
Style APA, Harvard, Vancouver, ISO itp.
25

Devadas, S. "Comparing two-level and ordered binary decision diagram representations of logic functions." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12, no. 5 (1993): 722–23. http://dx.doi.org/10.1109/43.277617.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

Khan, Hafiz Anwar Ullah, Mohamed Al Hosani, and Hatem Zeineldin. "Topology planning for autonomous MMGs: an ordered binary decision diagram‐based approach." IET Smart Grid 3, no. 1 (2020): 60–68. http://dx.doi.org/10.1049/iet-stg.2019.0083.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
27

Heap, Mark. "On the exact ordered binary decision diagram size of totally symmetric functions." Journal of Electronic Testing 4, no. 2 (1993): 191–95. http://dx.doi.org/10.1007/bf00971647.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
28

Ross, Don E., Kenneth M. Butler, and M. Ray Mercer. "Exact ordered binary decision diagram size when representing classes of symmetric functions." Journal of Electronic Testing 2, no. 3 (1991): 243–59. http://dx.doi.org/10.1007/bf00135441.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

Wei, Guan. "Reliability Analysis of the Internet of Things Based on Ordered Binary Decision Diagram." International Journal of Online Engineering (iJOE) 14, no. 08 (2018): 20. http://dx.doi.org/10.3991/ijoe.v14i08.9185.

Pełny tekst źródła
Streszczenie:
The reliability of the Internet of Things (IoT) system is analyzed and studied through ordered binary decision diagram (OBDD) to improve its design, application, and development. Based on the OBDD analysis, a reliability evaluation method named as enhanced node expansion (ENE) is proposed. This method provides an effective solution for the reliability assessment of IoT with large scale and complex network structure. A link importance assessment method based on OBDD analysis is also established. The proposed method can accurately and effectively evaluate the reliability of the IoT network and i
Style APA, Harvard, Vancouver, ISO itp.
30

Li, Long, Tianlong Gu, Liang Chang, Zhoubo Xu, Yining Liu, and Junyan Qian. "A Ciphertext-Policy Attribute-Based Encryption Based on an Ordered Binary Decision Diagram." IEEE Access 5 (2017): 1137–45. http://dx.doi.org/10.1109/access.2017.2651904.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
31

Schmidt, Tim, and Rong Zhou. "Representing Pattern Databases with Succinct Data Structures." Proceedings of the International Symposium on Combinatorial Search 2, no. 1 (2021): 142–49. http://dx.doi.org/10.1609/socs.v2i1.18195.

Pełny tekst źródła
Streszczenie:
In this paper we describe novel representations for precomputed heuristics based on Level-Ordered Edge Sequence (LOES) encodings. We introduce compressed LOES, an extension to LOES that enables more aggressive compression of the state-set representation. We evaluate the novel repre- sentations against the respective perfect-hash and binary decision diagram (BDD) representations of pattern databases in a variety of STRIPS domains.
Style APA, Harvard, Vancouver, ISO itp.
32

Kapernaum, Nadia, Friederike Knecht, C. Scott Hartley, Jeffrey C. Roberts, Robert P. Lemieux, and Frank Giesselmann. "Formation of smectic phases in binary liquid crystal mixtures with a huge length ratio." Beilstein Journal of Organic Chemistry 8 (July 19, 2012): 1118–25. http://dx.doi.org/10.3762/bjoc.8.124.

Pełny tekst źródła
Streszczenie:
A system of two liquid-crystalline phenylpyrimidines differing strongly in molecular length was studied. The phase diagram of these two chemically similar mesogens, with a length ratio of 2, was investigated, and detailed X-ray diffraction and electrooptical measurements were performed. The phase diagram revealed a destabilization of the nematic phase, which is present in the pure short compound, while the smectic state was stabilized. The short compound forms smectic A and smectic C phases, whereas the longer compound forms a broad smectic C phase and a narrow higher-ordered smectic phase. Ne
Style APA, Harvard, Vancouver, ISO itp.
33

Choi, Arthur, and Adnan Darwiche. "Dynamic Minimization of Sentential Decision Diagrams." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (2013): 187–94. http://dx.doi.org/10.1609/aaai.v27i1.8690.

Pełny tekst źródła
Streszczenie:
The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass. While OBDDs are characterized by total variable orders, SDDs are characterized more generally by vtrees. As both OBDDs and SDDs have canonical representations, searching for OBDDs and SDDs of minimal size simplifies to searching for variable orders and vtrees, respectively. For OBDDs, there are effective heuristics for dynamic reordering, based on locally swapping variables. In this paper, we propose an analogous appr
Style APA, Harvard, Vancouver, ISO itp.
34

Rauzy, Antoine, and Yang. "Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation Models." Information 10, no. 12 (2019): 368. http://dx.doi.org/10.3390/info10120368.

Pełny tekst źródła
Streszczenie:
In this article, we propose decision diagram algorithms to extract minimal cutsets of finite degradation models. Finite degradation models generalize and unify combinatorial models used to support probabilistic risk, reliability and safety analyses (fault trees, attack trees, reliability block diagrams…). They formalize a key idea underlying all risk assessment methods: states of the models represent levels of degradation of the system under study. Although these states cannot be totally ordered, they have a rich algebraic structure that can be exploited to extract minimal cutsets of models, w
Style APA, Harvard, Vancouver, ISO itp.
35

Wang, Ruiwei, and Roland H. C. Yap. "On the Modelling of Constraints with Tractable Logical Operators." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 11 (2025): 11381–89. https://doi.org/10.1609/aaai.v39i11.33238.

Pełny tekst źródła
Streszczenie:
Solving a Constraint Satisfaction Problem (CSP) usually requires a model typically using existing basic constraints. The most flexible form of constraint, ad-hoc (generic) constraints defined with certain constraint representations, such as binary constraint tree (BCT) and decision diagrams, have been proposed where basic constraints in intensional form are insufficient. A modeller may wish to combine basic constraints using logic operators (and, or, negation). However, negation, a key logical operator for expressivity is not tractable in many existing constraint representations. This creates
Style APA, Harvard, Vancouver, ISO itp.
36

Mateescu, R., R. Dechter, and R. Marinescu. "AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models." Journal of Artificial Intelligence Research 33 (December 17, 2008): 465–519. http://dx.doi.org/10.1613/jair.2605.

Pełny tekst źródła
Streszczenie:
Inspired by the recently introduced framework of AND/OR search spaces for graphical models, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function decomposition structure and to extend these compiled data structures to general weighted graphical models (e.g., probabilistic models). We present the AND/OR Multi-Valued Decision Diagram (AOMDD) which compiles a graphical model into a canonical form that supports polynomial (e.g., solution counting, belief updating) or constant time (e.g. equivalence of graphical models) queries. We provide two algor
Style APA, Harvard, Vancouver, ISO itp.
37

NINOMIYA, Hiroshi, Manabu KOBAYASHI, and Shigeyoshi WATANABE. "Reduced Reconfigurable Logic Circuit Design Based on Double Gate CNTFETs Using Ambipolar Binary Decision Diagram." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96.A, no. 1 (2013): 356–59. http://dx.doi.org/10.1587/transfun.e96.a.356.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

Bibilo, P. N. "Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram." Informatics 22, no. 1 (2025): 40–65. https://doi.org/10.37661/1816-0301-2025-22-1-40-65.

Pełny tekst źródła
Streszczenie:
Objectives. The problems of minimizing the number of cofactors (subfunctions) of the Shannon expansions located at the same level of the BDD, representing a system of incompletely defined (partial) Boolean functions, are considered. To reduce the number of functions, it is proposed to find a subset of such functions that can be expressed as algebraic decompositions of disjunctions or conjunctions of other predefined partial functions, while the directed graph of function occurrences in decompositions should not contain contours.Methods. Finding disjunctive and conjunctive decompositions requir
Style APA, Harvard, Vancouver, ISO itp.
39

Layeb, Abdesslem, and Djamel-Eddine Saidouni. "A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem." International Journal of Cognitive Informatics and Natural Intelligence 4, no. 4 (2010): 47–61. http://dx.doi.org/10.4018/jcini.2010100104.

Pełny tekst źródła
Streszczenie:
In this work, the authors focus on the quantum evolutionary quantum hybridization and its contribution in solving the binary decision diagram ordering problem. Therefore, a problem formulation in terms of quantum representation and evolutionary dynamic borrowing quantum operators are defined. The sifting search strategy is used in order to increase the efficiency of the exploration process, while experiments on a wide range of data sets show the effectiveness of the proposed framework and its ability to achieve good quality solutions. The proposed approach is distinguished by a reduced populat
Style APA, Harvard, Vancouver, ISO itp.
40

Banov, Reni, Zdenko Šimić, and Davor Grgić. "A new heuristics for the event ordering in binary decision diagram applied in fault tree analysis." Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 234, no. 2 (2019): 397–406. http://dx.doi.org/10.1177/1748006x19879305.

Pełny tekst źródła
Streszczenie:
Fault tree is a common approach in probabilistic risk assessment of complex engineering systems. Since their introduction, binary decision diagrams proved to be a valuable tool for complete quantification of hard fault tree models. As is known, the size of the binary decision diagram representation is mainly determined by the quality of the selected fault tree event ordering scheme. Finding the optimal event ordering for binary decision diagram representation is a computationally intractable problem, for which reason heuristic approaches are applied to find reasonable good ordering schemes. Th
Style APA, Harvard, Vancouver, ISO itp.
41

Xue, Yexiang, Arthur Choi, and Adnan Darwiche. "Basing Decisions on Sentences in Decision Diagrams." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (2021): 842–49. http://dx.doi.org/10.1609/aaai.v26i1.8221.

Pełny tekst źródła
Streszczenie:
The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass. While OBDDs are characterized by total variable orders, SDDs are characterized by dissections of variable orders, known as vtrees. Despite this generality, SDDs retain a number of properties, such as canonicity and a polytime apply operator, that have been critical to the practical success of OBDDs. Moreover, upper bounds on the size of SDDs were also given, which are tighter than comparable upper bounds on the size o
Style APA, Harvard, Vancouver, ISO itp.
42

Xu, Zhou Bo, Tian Long Gu, Liang Chang, and Feng Ying Li. "A Novel Symbolic OBDD Algorithm for Generating Mechanical Assembly Sequences Using Decomposition Approach." Advanced Materials Research 201-203 (February 2011): 24–29. http://dx.doi.org/10.4028/www.scientific.net/amr.201-203.24.

Pełny tekst źródła
Streszczenie:
The compact storage and efficient evaluation of feasible assembly sequences is one crucial concern for assembly sequence planning. The implicitly symbolic ordered binary decision diagram (OBDD) representation and manipulation technique has been a promising way. In this paper, Sharafat’s recursive contraction algorithm and cut-set decomposition method are symbolically implemented, and a novel symbolic algorithm for generating mechanical assembly sequences is presented using OBDD formulations of liaison graph and translation function. The algorithm has the following main procedures: choosing any
Style APA, Harvard, Vancouver, ISO itp.
43

Bibilo, P. N., and V. I. Romanov. "Experimental Study of Algorithms for Minimization of Binary Decision Diagrams using Algebraic Representations of Cofactors." Programmnaya Ingeneria 13, no. 2 (2022): 51–67. http://dx.doi.org/10.17587/prin.13.51-67.

Pełny tekst źródła
Streszczenie:
BDD (Binary Decision Diagram) is used for technology-independent optimization, performed as the first stage in the synthesis of logic circuits in the design of ASIC (application-specific integrated circuit). BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph is associated with the complete or reduced Shannon expansion formula. Binary decision diagrams with mutually inverse subfunctions (cofac-tors) are considered. We have developed algorithms for finding algebraic representations of cofactors of the same BDD level in the form of a di
Style APA, Harvard, Vancouver, ISO itp.
44

Bibilo, P. N., and V. I. Romanov. "Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors." Informatics 18, no. 2 (2021): 7–32. http://dx.doi.org/10.37661/1816-0301-2021-18-2-7-32.

Pełny tekst źródła
Streszczenie:
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in various technological bases. The BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph corresponds to the complete or reduced Shannon expansion formula. When BDD representation for systems of Boolean functions is constructed, it is possible to perform additional logical optimization based on
Style APA, Harvard, Vancouver, ISO itp.
45

Pimenov, Viktor, Mikhail Voronov, and Iliya Pimenov. "The cognitive visualization of classifying rules extracted from data based on binary solver matrix model." Information and Control Systems, no. 6 (January 16, 2020): 2–11. http://dx.doi.org/10.31799/1684-8853-2019-6-2-11.

Pełny tekst źródła
Streszczenie:
Introduction: Huge volumes of data are generated in cyberspace or from internal information of various organizations. In order to obtain a set of output data with a clear structure, divide it into significant parts and develop rules of classification, machine learning methods are used. Most inductive methods simulate intermediate and high-level abstract categories in multidimensional space which are difficult to interpret. Purpose: Developing a model of machine learning in the form of a “white box” which explains the chosen solution using conventional production rules, along with cognitive vis
Style APA, Harvard, Vancouver, ISO itp.
46

Afzaal, T., R. AlRamdan, H. Bualbanat, et al. "A67 REDUCING INAPPROPRIATE GAMMA-GLUTAMYL TRANSFERASE TESTING FOR INPATIENTS: A QUALITY IMPROVEMENT INITIATIVE IN LAB WASTE REDUCTION APPLYING THE MODEL FOR CONTINUOUS IMPROVEMENT." Journal of the Canadian Association of Gastroenterology 7, Supplement_1 (2024): 45–46. http://dx.doi.org/10.1093/jcag/gwad061.067.

Pełny tekst źródła
Streszczenie:
Abstract Background Review of the literature identifies a rising trend in laboratory testing, with over 30% of tests estimated to be inappropriately repeated. Laboratory overutilization increases healthcare costs, and can lead to overdiagnosis, overtreatment and negative health outcomes. Indications for repeat Gamma Glutamyl Transferase (GGT) testing in adults are limited, particularly repeat testing within the same admission. Aims Our aim was to reduce the inappropriate ordering of repeat GGT testing by 25% for all inpatients at the London Health Sciences Centre (LHSC) over a one-year study p
Style APA, Harvard, Vancouver, ISO itp.
47

Sadchenko, A. V., O. A. Kushnirenko, and E. K. Koshelev. "Anti-interference pulsed laser ranging system." Технология и конструирование в электронной аппаратуре, no. 1-2 (2020): 8–14. http://dx.doi.org/10.15222/tkea2020.1-2.08.

Pełny tekst źródła
Streszczenie:
Pulsed laser rangefinders prove to be cost-effective and practical devices when used at distances of several tens of kilometers due to their compactness, portability and energy efficiency. However, the measurement accuracy is significantly reduced by the presence of pulsed interference affecting the input of the optical receiver both during the sensing period and when the reflected signal is being received. Using the algorithms with the accumulation and subsequent processing of the results of several successive measurements reduces the speed of decision-making and does not guarantee the conver
Style APA, Harvard, Vancouver, ISO itp.
48

Bagde, Vandana, and Dethe C. G. "Performance improvement of space diversity technique using space time block coding for time varying channels in wireless environment." International Journal of Intelligent Unmanned Systems 10, no. 2/3 (2020): 278–86. http://dx.doi.org/10.1108/ijius-04-2019-0026.

Pełny tekst źródła
Streszczenie:
PurposeA recent innovative technology used in wireless communication is recognized as multiple input multiple output (MIMO) communication system and became popular for quicker data transmission speed. This technology is being examined and implemented for the latest broadband wireless connectivity networks. Though high-capacity wireless channel is identified, there is still requirement of better techniques to get increased data transmission speed with acceptable reliability. There are two types of systems comprising of multi-antennas placed at transmitting and receiving sides, of which first is
Style APA, Harvard, Vancouver, ISO itp.
49

Paczesny, Sophie, Iztok Hozo, and Benjamin Djulbegovic. "Sinusoidal Obstruction Syndrome (SOS) Biomarkers-Derived Predictive Model to Individualize SOS Preemption in Patients Undergoing Allogeneic Stem Cell Transplant." Blood 142, Supplement 1 (2023): 4895. http://dx.doi.org/10.1182/blood-2023-172813.

Pełny tekst źródła
Streszczenie:
Background: We have previously reported that the predictive model based on 3 biomarkers [L-ficolin, hyaluronic acid (HA), and stimulation 2 (ST2)] can accurately stratify the risk of sinusoidal obstruction syndrome (SOS) in high (>30%) vs low (<5%) risk groups [ JCI Insight. 2023; 8(10):e168221]. However, the improved risk stratification for SOS does not necessarily help guide the administration of the risk-adapted preemptive therapy. Here we set out to assess the clinical utility of the SOS model by integrating its prediction with the consequences (benefits and harms) of preempt
Style APA, Harvard, Vancouver, ISO itp.
50

Das, Apangshu, Vivek Kumar Singh, and Sambhu Nath Pradhan. "Shared reduced ordered binary decision diagram‐based thermal‐aware network synthesis." International Journal of Circuit Theory and Applications, March 2022. http://dx.doi.org/10.1002/cta.3255.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii