198 search results - page 18 / 40 » Fundamental performance limitations with Kullback-Leibler co... |
127
Voted
HPCA
2002
IEEE
16 years 2 months ago
2002
IEEE
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
MICRO
2008
IEEE
15 years 8 months ago
2008
IEEE
—L1 instruction-cache misses pose a critical performance bottleneck in commercial server workloads. Cache access latency constraints preclude L1 instruction caches large enough t...
116
Voted
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
118
click to vote
SC
2000
ACM
15 years 5 months ago
2000
ACM
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to mi...
127
Voted
SIGIR
2008
ACM
15 years 9 days ago
2008
ACM
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...