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 3 of 3 for “"zero-suppressed binary decision diagrams"”.

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

    … Boolean formulas. 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 …

    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)

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

    … and their delay 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) …

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

  3. New methods for branch-and-bound algorithms

    … the pricing problem which respects the branching decisions at the current subproblem). The first method uses a data structure called a zero-suppressed binary decision diagram (ZDD) to solve the pricing problem and keep track of previous branching decisions. Bounds are proved on the size of a ZDD …

    uiuc Repository record for New methods for branch-and-bound algorithms (opens in a new tab)