Sciweavers

2056 search results - page 287 / 412
» time 2000
Sort
View
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 10 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
DEXAW
2000
IEEE
88views Database» more  DEXAW 2000»
15 years 10 months ago
Spatio-Temporal Databases: Contentions, Components and Consolidation
Spatio-temporal databases have been the focus of considerable research activity over a significant period. However, there are as of yet very few prototypes of complete systems, f...
Norman W. Paton, Alvaro A. A. Fernandes, Tony Grif...
DFT
2000
IEEE
105views VLSI» more  DFT 2000»
15 years 10 months ago
Low-Speed Scan Testing of Charge-Sharing Faults for CMOS Domino Circuits
Because domino logic design offers smaller area and higher speed than complementary CMOS design, it has been very popularly used to design highperformance processors. However: dom...
Ching-Hwa Cheng, Jinn-Shyan Wang, Shih-Chieh Chang...
DSN
2000
IEEE
15 years 10 months ago
Dynamic Byzantine Quorum Systems
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
Lorenzo Alvisi, Evelyn Tumlin Pierce, Dahlia Malkh...
DSN
2000
IEEE
15 years 10 months ago
Whither Generic Recovery from Application Faults? A Fault Study using Open-Source Software
This paper tests the hypothesis that generic recovery techniques, such as process pairs, can survive most application faults without using application-specific information. We ex...
Subhachandra Chandra, Peter M. Chen