2663 search results - page 363 / 533 » How to Choose a Timing Model |
114
Voted
HPCA
2008
IEEE
15 years 10 months ago
2008
IEEE
Real-world workloads rarely saturate multi-core processor. CPU C-states can be used to reduce power consumption during processor idle time. The key unsolved problem is: when and h...
132
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
111
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
139
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
114
click to vote
ARCS
2006
Springer
15 years 7 months ago
2006
Springer
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...