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 30 for “"Decision diagrams"”.

  1. EXOR-basierte Logiksynthese mit Kronecker Functional Decision Diagrams

    In dieser Arbeit wird ein Syntheseverfahren zur Analyse der <br>Abhängigkeiten in KFDDs vorgestellt. <br>In KFDDs wird neben der Shannon Dekomposition auch die Davio <br>Dekomposition eingesetzt, die auf der EXOR-Operation basiert. <br>Daher wird die Verwendung von EXOR-Gattern in den …

    freiburg-diss Repository record for EXOR-basierte Logiksynthese mit Kronecker Functional Decision Diagrams (opens in a new tab)

  2. Applying binary decision diagrams to learn hidden Markov models

    … 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)

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

    … 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 evolvability …

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

  4. Improving Approximate and Exact Approaches Based on Decision Diagrams and Dynamic Programming for Combinatorial Optimization

    … and exact methodologies for CO by leveraging Decision Diagrams (DDs) and Dynamic Programming (DP). Decision Diagrams offer a powerful graphical representation of the solution space, enabling both over- and under-approximations, known as relaxed and restricted DDs, that yield dual and primal …

    bielefeld Repository record for Improving Approximate and Exact Approaches Based on Decision Diagrams and Dynamic Programming for Combinatorial Optimization (opens in a new tab)

  5. 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 efficiently …

    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)

  6. Implementation of symbolic model checking for probabilistic systems

    … 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 more than …

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

  7. Symbolic methods for testing digital circuits

    … of symbolic methods, realized by Boolean Decision Diagrams (BDDs), in the field of testing both combinational and synchronous sequential digital circuits at gate level. <br>Both major topics, fault simulation and automated test pattern generation (ATPG), have been examined, among others, …

    freiburg-diss Repository record for Symbolic methods for testing digital circuits (opens in a new tab)

  8. 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 circuit …

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

  9. Symbolic Approaches for Boolean Synthesis

    … 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 becomes …

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

  10. 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)

  11. Analysis and optimization of digital circuit dynamic behavior

    … the behavior graph analytically using binary decision diagrams (BDD). Based on this analytical timing-error-probability framework, a logic optimization algorithm is developed to utilize dual threshold voltage (dualVt) cells to optimize a circuit's throughput in such a way that the most …

    uiuc Repository record for Analysis and optimization of digital circuit dynamic behavior (opens in a new tab)

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

    … 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 informative …

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

  13. Variant configuration and management : challenges and opportunities

    … 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)

  14. Model checking multi-agent systems

    … 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)

  15. Solving Hybrid Boolean SAT by Continuous Optimization

    … 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 supporting …

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

  16. 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)

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

    … 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)

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

    … 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 the …

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

  19. 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)

Page 1 of 2