3693 search results - page 685 / 739 » Paper on the Move |
170
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
141
click to vote
ACMMSP
2004
ACM
15 years 11 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
166
click to vote
ASPLOS
2004
ACM
15 years 11 months ago
2004
ACM
This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterpr...
145
click to vote
ISLPED
2004
ACM
15 years 11 months ago
2004
ACM
The need to perform early design studies that combine architectural simulation with power estimation has become critical as power has become a design constraint whose importance h...
169
click to vote
NPAR
2004
ACM
15 years 11 months ago
2004
ACM
ssionism”, (bottom row) “Abstract”, “Pointillism”, “Flower” and “Abstract” styles. Figure 3 shows some of the brush strokes used. We present techniques for trans...