2173 search results - page 147 / 435 » On the Values of Reducibility Candidates |
162
click to vote
MICRO
1998
IEEE
15 years 10 months ago
1998
IEEE
Load latency remains a significant bottleneck in dynamically scheduled pipelined processors. Load speculation techniques have been proposed to reduce this latency. Dependence Pred...
147
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
We suggest a new technique to reduce energy consumption in the processor datapath without sacrificing performance by exploiting operand value locality at run time. Data locality is...
160
click to vote
ICML
1990
IEEE
15 years 10 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
181
click to vote
BIBE
2009
IEEE
15 years 9 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
174
click to vote
FLAIRS
2008
15 years 8 months ago
2008
In the paper, we investigate the use of reinforcement learning in CBR for estimating and managing a legacy case base for playing the game of Tetris. Each case corresponds to a loc...