9716 search results - page 327 / 1944 » The Case for Energy-Proportional Computing |
172
click to vote
IWPEC
2004
Springer
16 years 6 days ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
159
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
174
click to vote
TACAS
2005
Springer
16 years 9 days ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
197
Voted
SIGCSE
2004
ACM
16 years 8 days ago
2004
ACM
Reacting to challenges that have been observed in humancomputer interaction (HCI) education, as well as the multidisciplinary design, science, and engineering underpinnings, we in...
193
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...