2479 search results - page 92 / 496 » A Computational Theory of Working Memory |
190
click to vote
TSP
2010
15 years 1 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
202
Voted
ERSA
2007
15 years 6 months ago
2007
Abstract: If the computational demands of an interactive graphics rendering application cannot be met by a single commodity Graphics Processing Unit (GPU), multiple graphics accele...
136
click to vote
GLVLSI
2003
IEEE
15 years 10 months ago
2003
IEEE
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
135
click to vote
HPCA
2002
IEEE
16 years 5 months ago
2002
IEEE
This work is based on our philosophy of providing interlayer system-level power awareness in computing systems [26, 27]. Here, we couple this approach with our vision of multipart...
141
click to vote
EUROPAR
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...