Sciweavers

1670 search results - page 3 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
CP
2001
Springer
14 years 27 days ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
EDCC
2005
Springer
14 years 1 months ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...
SIP
2001
13 years 9 months ago
Convergence acceleration of the LMS algorithm using successive data orthogonalization
We propose a new adaptive filtering algorithm whose convergence rate is very fast even for a highly correlated input signal. It is well-known that convergence rate gets worse when...
H.-C. Shin, W.-J. Song
CAL
2006
13 years 8 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
APLAS
2005
ACM
14 years 1 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...