Sciweavers

2529 search results - page 263 / 506
» The Logical Structure of Binding
Sort
View
ICCS
2005
Springer
16 years 5 days ago
A Logarithmic Time Method for Two's Complementation
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
Jung-Yup Kang, Jean-Luc Gaudiot
SAT
2004
Springer
158views Hardware» more  SAT 2004»
16 years 15 hour ago
Aligning CNF- and Equivalence-Reasoning
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
Marijn Heule, Hans van Maaren
ITC
2003
IEEE
170views Hardware» more  ITC 2003»
15 years 12 months ago
Double-Tree Scan: A Novel Low-Power Scan-Path Architecture
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zha...
DATE
2002
IEEE
107views Hardware» more  DATE 2002»
15 years 11 months ago
High-Speed Non-Linear Asynchronous Pipelines
Many approaches recently proposed for high-speed asynchronous pipelines are applicable only to linear datapaths. However, real systems typically have non-linearities in their data...
Recep O. Ozdag, Peter A. Beerel, Montek Singh, Ste...
ECTEL
2006
Springer
15 years 10 months ago
A Document Reuse Tool for Communities of Practice
With the rise of the Internet, virtual communities of practice are gaining importance as a mean of sharing and exchanging information. In such environments, information reuse is of...
Aida Boukottaya, Bernadette Charlier, Christine Va...