2095 search results - page 73 / 419 » Improved pebbling bounds |
114
Voted
RTAS
2005
IEEE
15 years 6 months ago
2005
IEEE
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
130
Voted
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
95
Voted
NETWORKING
2004
15 years 2 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
95
Voted
SIGGRAPH
2009
ACM
15 years 7 months ago
2009
ACM
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...