Sciweavers

768 search results - page 116 / 154
» Robustness of Sequential Circuits
Sort
View
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 5 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 5 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
ANCS
2006
ACM
14 years 2 months ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu
IMR
2005
Springer
14 years 2 months ago
An Interior Surface Generation Method for All-Hexahedral Meshing
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...
Tatsuhiko Suzuki, Shigeo Takahashi, Jason Shepherd
CF
2004
ACM
14 years 2 months ago
Designing and testing fault-tolerant techniques for SRAM-based FPGAs
This paper discusses fault-tolerant techniques for SRAM-based FPGAs. These techniques can be based on circuit level modifications, with obvious modifications in the programmable a...
Fernanda Lima Kastensmidt, Gustavo Neuberger, Luig...