Sciweavers

6607 search results - page 313 / 1322
» Making TeX Work
Sort
View
DAC
1997
ACM
15 years 8 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
DL
1997
Springer
206views Digital Library» more  DL 1997»
15 years 8 months ago
The Digital Library Integrated Task Environment (DLITE)
We describe a case study in the design of a user interface to a digital library. Our design stems from a vision of a library as a channel to the vast array of digital information ...
Steve B. Cousins, Andreas Paepcke, Terry Winograd,...
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
15 years 8 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
SRDS
1996
IEEE
15 years 8 months ago
Minimizing Timestamp Size for Completely Asynchronous Optimistic Recovery with Minimal Rollback
Basing rollback recovery on optimistic message logging and replay avoids the need for synchronization between processes during failure-free execution. Some previous research has a...
Sean W. Smith, David B. Johnson
192
Voted
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
15 years 8 months ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail