Sciweavers

2056 search results - page 268 / 412
» time 2000
Sort
View
FSTTCS
2001
Springer
15 years 10 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
DATE
2000
IEEE
130views Hardware» more  DATE 2000»
15 years 10 months ago
Optimal Hardware Pattern Generation for Functional BIST
∗∗ Functional BIST is a promising solution for self-testing complex digital systems at reduced costs in terms of area and performance degradation. The present paper addresses t...
Silvia Cataldo, Silvia Chiusano, Paolo Prinetto, H...
MM
2000
ACM
217views Multimedia» more  MM 2000»
15 years 10 months ago
Design and implementation of the parallel multimedia file system based on message distribution
The two-layered distributed clustered server architecture consisting of a control server and a group of storage servers has been widely used to support multimedia file systems. Wi...
Seung-Ho Park, Si-Yong Park, Gwang Moon Kim, Ki-Do...
170
Voted
COMPUTER
2000
138views more  COMPUTER 2000»
15 years 6 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
183
Voted
PDPTA
2000
15 years 7 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed