Sciweavers

1534 search results - page 57 / 307
» Error Reporting Logic
Sort
View
TCAD
2008
93views more  TCAD 2008»
14 years 10 months ago
Transforming Cyclic Circuits Into Acyclic Equivalents
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
Osama Neiroukh, Stephen A. Edwards, Xiaoyu Song
VTS
1997
IEEE
86views Hardware» more  VTS 1997»
15 years 2 months ago
Incremental logic rectification
We address the problem of rectifying an incorrect combinational circuit against a given specification. Based on the symbolic BDD techniques, we consider the rectification process,...
Shi-Yu Huang, Kuang-Chien Chen, Kwang-Ting Cheng
FTCS
1993
94views more  FTCS 1993»
14 years 11 months ago
Balance Testing of Logic Circuits
We present a new test response compression method called cumulative balance testing (CBT)that extends both balance testing and accumulatorcompression testing. CBT uses an accumulat...
Krishnendu Chakrabarty, John P. Hayes
SIGIR
1998
ACM
15 years 2 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
AAAI
2006
14 years 11 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee