2479 search results - page 59 / 496 » A Computational Theory of Working Memory |
DAC
1997
ACM
13 years 12 months ago
1997
ACM
Binary Decision Diagrams BDDs are e cient at manipulating large sets in a compact manner. BDDs, however, are inefcient at utilizing the memory hierarchy of the computer. Recent ...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is n correctly-implemented concurrency abstraction...
IEEEPACT
1998
IEEE
13 years 12 months ago
1998
IEEE
This work identifies practical compiling techniques for scalable shared memory machines. For this, we have focused on experimental studies using a real machine and representative ...
RT
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper presents a comparison of basic progressive and wavelet radiosity algorithms. Several variants of each algorithm were run on a set of scenes at several paramete...