Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Binary Decision Diagrams"”.

  1. Applying binary decision diagrams to learn hidden Markov models

    … a cornerstone of BW, adapting it to operate on Binary Decision Diagrams (BDDs). The time and memory complexity of the algorithm is contingent on the size of the BDD, highlighting that the BDD’s size significantly depends on the variable ordering (a problem known to be NP-complete). Preliminary …

    reykjavik Repository record for Applying binary decision diagrams to learn hidden Markov models (opens in a new tab)

  2. Artificial evolution with Binary Decision Diagrams: a study in evolvability in neutral spaces

    This thesis develops a new approach to evolving Binary Decision Diagrams, and uses it to study evolvability issues. For reasons that are not yet fully understood, current approaches to artificial evolution fail to exhibit the evolvability so readily exhibited in nature. To be able to apply …

    birmingham Repository record for Artificial evolution with Binary Decision Diagrams: a study in evolvability in neutral spaces (opens in a new tab)

  3. A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization

    … ZQSAT is based on ZBDD: Zero-Suppressed Binary Decision Diagram , which is a variant of BDD, and an adopted version of the DPLL algorithm. It has been implemented in C using the CUDD: Colorado University Decision Diagram package. The capability of ZBDDs in storing sets of subsets …

    potsdam-diss Repository record for A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization (opens in a new tab)

  4. Implementation of symbolic model checking for probabilistic systems

    … which are based on a data structure called binary decision diagrams (BDDs), we present an extension to the probabilistic case, using multi-terminal binary decision diagrams (MTBDDs). We demonstrate that MTBDDs can be used to perform probabilistic analysis of large, structured models with …

    birmingham Repository record for Implementation of symbolic model checking for probabilistic systems (opens in a new tab)

  5. Symbolic techniques for VLSI test and diagnosis

    … Recently, due to the development of binary decision diagrams (BDDs), symbolic methods have become a practical means of handling the large sets encountered in these applications. In this thesis, several algorithms are presented which make use of BDDs to address problems in digital …

    uiuc Repository record for Symbolic techniques for VLSI test and diagnosis (opens in a new tab)

  6. Symbolic techniques for the performance analysis of generalised stochastic petri nets

    Binary Decision Diagrams (BDDs) have been successfully used in sequential circuit theory, VLSI, and model checking. They form a highly memory efficient canonical representation of a Boolean function. In this dissertation, following on the success of BDDs in other fields, we investiage the …

    cape-town Repository record for Symbolic techniques for the performance analysis of generalised stochastic petri nets (opens in a new tab)

  7. Probabilistic Topologies with Applications in Security and Resilience of Multi-Robot Systems

    … resilience of an MRS. In our modeling, we use binary decision diagrams, convolutional neural networks, matroid theory and more to tackle the problems related to probabilistic security and resilience where we find exact solutions, calculate bounds, solve optimization problems, and compute …

    vt Repository record for Probabilistic Topologies with Applications in Security and Resilience of Multi-Robot Systems (opens in a new tab)

  8. Variant configuration and management : challenges and opportunities

    … and "interactive configurator" concepts. Use of "Binary Decision Diagrams" is recommended to achieve higher runtime performance when using interactive configurators for large modular systems and large teams. Also, I propose different visualization techniques to enable model designers to understand …

    mit Repository record for Variant configuration and management : challenges and opportunities (opens in a new tab)

  9. Model checking multi-agent systems

    … traditional methodologies based on Ordered Binary Decision Diagrams (OBDDS) for temporal logics to multi-modal logics for time, knowledge, correct behaviour, and strategies of agents. Complexity results for model checking these logics (and their symbolic representations). • Development of a …

    ucl Repository record for Model checking multi-agent systems (opens in a new tab)

  10. Solving Hybrid Boolean SAT by Continuous Optimization

    … limit its potential. The thesis presents to use binary decision diagrams (BDDs) to replace polynomials, which significantly accelerates the gradient computation both in theory and practice, meanwhile handling PB constraints. The thesis then proposes an approach for removing the requirement of …

    rice Repository record for Solving Hybrid Boolean SAT by Continuous Optimization (opens in a new tab)

  11. Policy Reasoning for Spectrum Agile Radios

    … of a novel policy reasoner called Bi- nary Decision Diagram based Reasoner for processing Spectrum Access Policies (BRESAP). BRESAP processes spectrum policies efficiently by reframing the policy reasoning problem as a graph based Boolean function manipulation problem. BRESAP uses Binary

    vt Repository record for Policy Reasoning for Spectrum Agile Radios (opens in a new tab)

  12. Methodologies for Test and Diagnosis of Delay Defects in Integrated Circuits

    … distributions are stored in Zero Suppressed Binary Decision Diagrams. Experimental results on some of the largest ISCAS-89 and ITC-99 benchmarks shows that the proposed method is highly scalable and effective. Lastly, an approach to select a set of longest (highest critical) paths under a …

    siu-theses Repository record for Methodologies for Test and Diagnosis of Delay Defects in Integrated Circuits (opens in a new tab)

  13. Analysis and Mitigation of Multiple Radiation Induced Errors in Modern Circuits

    … either exhaustive input pattern simulation or binary decision diagrams. The problem with both approaches is that simulation of the circuit can be intractably time consuming or can encounter memory blowup. To solve this issue, a simulation tool is proposed which employs partitioning to reduce …

    siu-theses Repository record for Analysis and Mitigation of Multiple Radiation Induced Errors in Modern Circuits (opens in a new tab)

  14. Practical verification of network planes

    … verification. Our design is inspired by Binary Decision Diagrams, but is able to overcome some specific limitations of BDDs in the context of storing packet sets. We describe a set of benchmark traces for evaluating packet set data structures, and perform an experimental comparison of our …

    uiuc Repository record for Practical verification of network planes (opens in a new tab)

  15. Symbolic Approaches for Boolean Synthesis

    … also symbolic approaches, especially those using Binary Decision Diagrams (BDDs), an acyclic directed graph that maps the solutions for a boolean formula to its paths. Scalability challenges also rose as exponential memory blowups occurred in handling large-scale problems using BDDs, but it also …

    rice Repository record for Symbolic Approaches for Boolean Synthesis (opens in a new tab)

  16. Improved Symbolic Model Checking of Real-Time Systems

    … the model checking technique based on binary decision diagrams (BDDs) has been shown to be successful in handling the state space explosion. However, the application of BDD-based model checking requires knowledge of BDDs and is difficult for hierarchical systems. Moreover, the …

    nus Repository record for Improved Symbolic Model Checking of Real-Time Systems (opens in a new tab)

  17. Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms

    … algorithms to manipulate Reduced Ordered Binary Decision Diagrams (ROBDD) on multi-core machines. In order to perform multiple BDD operations concurrently, our algorithm uses a breadth-first search (BFS). As ROBDD algorithms are memory-intensive, maintaining locality of data is an …

    vt Repository record for Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms (opens in a new tab)

  18. Formal Verification Techniques for Reversible Circuits

    … of this design. This work proposes the use of Binary Decision Diagrams for optimization of reversible circuits. The proposed technique identifies repeated gate (trivial) as well as non-contiguous redundancies in a reversible circuit. Construction of a BDD for a sub-circuit (obtained by sliding …

    vt Repository record for Formal Verification Techniques for Reversible Circuits (opens in a new tab)

  19. Function-based Algorithms for Biological Sequences

    … of presented methods is the use of binary decision diagrams that store and manipulate binary functions. Searching for a particular pattern in a very large DNA database, is a fundamental and essential component in computational biology. In the biological world, pattern matching is …

    siu-theses Repository record for Function-based Algorithms for Biological Sequences (opens in a new tab)

Page 1 of 2