431 search results - page 24 / 87 » The predictability of branches in libraries |
WOSP
2004
ACM
14 years 29 days ago
2004
ACM
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
MAM
2007
13 years 7 months ago
2007
ct 8 As a result of resource limitations, state in branch predictors is frequently shared between uncorrelated branches. This interference 9 can significantly limit prediction acc...
APCSAC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract. The perceptron predictor is a highly accurate branch predictor. Unfortunately this high accuracy comes with high complexity. The high complexity is the result of the larg...
EMNLP
2010
13 years 5 months ago
2010
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...