5595 search results - page 402 / 1119 » Comparing Subsumption Optimizations |
281
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
155
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
262
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very i...
163
click to vote
HIPEAC
2010
Springer
16 years 3 months ago
2010
Springer
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
165
click to vote
ICCD
2003
IEEE
16 years 3 months ago
2003
IEEE
Compiled simulation is a well known technique for improving the performance of instruction set simulators at the cost of compilation time. However the compilation time overhead ma...