Sciweavers

16430 search results - page 3217 / 3286
» On Computable Tree Functions
Sort
View
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
13 years 11 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
ISLPED
1995
ACM
131views Hardware» more  ISLPED 1995»
13 years 11 months ago
Guarded evaluation: pushing power management to logic synthesis/design
The need to reduce the power consumption of the next generation of digital systems is clearly recognized. At the system level, power management is a very powerful technique and de...
Vivek Tiwari, Sharad Malik, Pranav Ashar
POPL
1995
ACM
13 years 11 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
13 years 11 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
SIGLEX
1991
13 years 11 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa
« Prev « First page 3217 / 3286 Last » Next »