Sciweavers

2555 search results - page 103 / 511
» Quantifiers and Working Memory
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
15 years 10 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
ISCA
2011
IEEE
294views Hardware» more  ISCA 2011»
14 years 1 months ago
Moguls: a model to explore the memory hierarchy for bandwidth improvements
In recent years, the increasing number of processor cores and limited increases in main memory bandwidth have led to the problem of the bandwidth wall, where memory bandwidth is b...
Guangyu Sun, Christopher J. Hughes, Changkyu Kim, ...
ATAL
2010
Springer
14 years 11 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
IPPS
2003
IEEE
15 years 3 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova
69
Voted
DATE
2010
IEEE
145views Hardware» more  DATE 2010»
15 years 3 months ago
An evaluation of a slice fault aware tool chain
Abstract—As FPGA sizes and densities grow, their manufacturing yields decrease. This work looks toward reclaiming some of this lost yield. Several previous works have suggested f...
Adwait Gupte, Phillip Jones