Sciweavers

72 search results - page 9 / 15
» Secure function evaluation with ordered binary decision diag...
Sort
View
DAC
1996
ACM
13 years 11 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
14 years 1 months ago
Design of Classifier to Automate the Evaluation of Protein Crystallization States
– This paper presents a method for designing classifier to automate an evaluation process of protein crystallization growth states. The classifier is designed by binary decision ...
Kanako Saitoh, Kuniaki Kawabata, Hajime Asama, Tak...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 24 days ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki