277 search results - page 39 / 56 » A transformation based algorithm for reversible logic synthe... |
146
click to vote
AAAI
1997
15 years 5 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
171
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
109
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
141
click to vote
DDECS
2008
IEEE
15 years 10 months ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...