Sciweavers

983 search results - page 71 / 197
» Circuit Complexity and Multiplicative Complexity of Boolean ...
Sort
View
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 3 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
ISLPED
2003
ACM
129views Hardware» more  ISLPED 2003»
14 years 3 months ago
A critical analysis of application-adaptive multiple clock processors
Enabled by the continuous advancement in fabrication technology, present day synchronous microprocessors include more than 100 million transistors and have clock speeds well in ex...
Emil Talpes, Diana Marculescu
ECML
1997
Springer
14 years 2 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 3 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
DAC
2004
ACM
14 years 2 months ago
Communication-efficient hardware acceleration for fast functional simulation
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
Young-Il Kim, Woo-Seung Yang, Young-Su Kwon, Chong...