11328 search results - page 22 / 2266 » Timed Branching Processes |
124
Voted
ISCA
1995
IEEE
15 years 5 months ago
1995
IEEE
Accurate instruction fetch and branch prediction is increasingly important on today’s wide-issue architectures. Fetch prediction is the process of determining the next instructi...
111
click to vote
ISCA
1997
IEEE
15 years 6 months ago
1997
IEEE
As processor architectures have increased their reliance on speculative execution to improve performance, the importance of accurate prediction of what to execute speculatively ha...
142
click to vote
DSN
2011
IEEE
14 years 1 months ago
2011
IEEE
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
86
Voted
ICALP
1997
Springer
15 years 6 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
107
Voted
TCS
2008
15 years 1 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...