Sciweavers

1192 search results - page 108 / 239
» Computing Weakest Readings
Sort
View
HPCA
1997
IEEE
15 years 10 months ago
Design Issues and Tradeoffs for Write Buffers
Processors with write-through caches typically require a write buffer to hide the write latency to the next level of memory hierarchy and to reduce write traffic. A write buffer ...
Kevin Skadron, Douglas W. Clark
CONEXT
2007
ACM
15 years 10 months ago
Energy-efficient MAC and routing design in distributed beamforming sensor networks
A major task of a wireless sensor network is energy-efficient, timely, and robust dissemination of sensor readings back to the sink node. The AIDA project [1] aims to create a new...
Dimitrios Koutsonikolas, Syed Ali Raza Jafri, Y. C...
CCGRID
2004
IEEE
15 years 10 months ago
Remote partial file access using compact pattern descriptions
We present a method for the efficient access to parts of remote files. The efficiency is achieved by using a file format independent compact pattern description, that allows to re...
Thorsten Schütt, André Merzky, Andrei ...
CW
2004
IEEE
15 years 10 months ago
An Interactive Agent-Based Learning Environment for Children
This paper presents an educational distributed virtual reality-based environment for children called EVE - Environnement Virtuel pour Enfants. EVE is used in elementary schools fr...
Dorin Mircea Popovici, Cédric Buche, Ronan ...
DSN
2004
IEEE
15 years 10 months ago
Tolerating Hard Faults in Microprocessor Array Structures
In this paper, we present a hardware technique, called Self-Repairing Array Structures (SRAS), for masking hard faults in microprocessor array structures, such as the reorder buff...
Fred A. Bower, Paul G. Shealy, Sule Ozev, Daniel J...