9716 search results - page 276 / 1944 » The Case for Energy-Proportional Computing |
196
click to vote
SSD
2005
Springer
16 years 6 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
172
click to vote
UC
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
167
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
188
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
351
click to vote
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...