Sciweavers

2035 search results - page 318 / 407
» Working memory
Sort
View
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 3 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
CIKM
1995
Springer
15 years 3 months ago
Using Speculation to Reduce Server Load and Service Time on the WWW
Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers the...
Azer Bestavros
UMC
2000
15 years 3 months ago
In-vitro Transcriptional Circuits
The structural similarity of neural networks and genetic regulatory networks to digital circuits, and hence to each other, was noted from the very beginning of their study [1, 2]....
Erik Winfree
SPAA
1995
ACM
15 years 3 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
DAC
2010
ACM
15 years 3 months ago
Efficient fault simulation on many-core processors
Fault simulation is essential in test generation, design for test and reliability assessment of integrated circuits. Reliability analysis and the simulation of self-test structure...
Michael A. Kochte, Marcel Schaal, Hans-Joachim Wun...