3600 search results - page 210 / 720 » The settling-time reducibility ordering |
177
click to vote
LCN
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
191
click to vote
ASPLOS
1998
ACM
15 years 10 months ago
1998
ACM
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
171
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
183
click to vote
MICRO
1997
IEEE
15 years 10 months ago
1997
IEEE
Most modern microprocessors employ one or two levels of on-chip caches in order to improve performance. These caches are typically implemented with static RAM cells and often occu...
149
click to vote
ITC
1996
IEEE
15 years 10 months ago
1996
IEEE
Orthogonal scan paths, which follow the path of the data flow, can be used in data path designs to reduce the test overhead -- area, delay and test application time -- by sharing ...