Sciweavers

8540 search results - page 1507 / 1708
» The Dynamic Servers Problem
Sort
View
134
Voted
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
15 years 8 months ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu
217
Voted
WWCA
1998
Springer
15 years 7 months ago
Compact and Flexible Resolution of CBT Multicast Key-Distribution
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
Kanta Matsuura, Yuliang Zheng, Hideki Imai
125
Voted
RTSS
1997
IEEE
15 years 7 months ago
Static priority scheduling for ATM networks
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
Chengzhi Li, Riccardo Bettati, Wei Zhao
134
Voted
DAC
1997
ACM
15 years 7 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
162
Voted
SIGGRAPH
1997
ACM
15 years 7 months ago
Rendering complex scenes with memory-coherent ray tracing
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
Matt Pharr, Craig E. Kolb, Reid Gershbein, Pat Han...
« Prev « First page 1507 / 1708 Last » Next »