Sciweavers

15 search results - page 2 / 3
» Split Last-Address Predictor
Sort
View
ICS
1998
Tsinghua U.
13 years 9 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 9 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
AIRWEB
2005
Springer
13 years 11 months ago
An Analysis of Factors Used in Search Engine Ranking
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
Albert Bifet, Carlos Castillo, Paul-Alexandru Chir...
ISHPC
2000
Springer
13 years 9 months ago
Loop Termination Prediction
Deeply pipelined high performance processors require highly accurate branch prediction to drive their instruction fetch. However there remains a class of events which are not easi...
Timothy Sherwood, Brad Calder
CSDA
2004
77views more  CSDA 2004»
13 years 5 months ago
Variable selection bias in regression trees with constant fits
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Yu-Shan Shih, Hsin-Wen Tsai