11328 search results - page 34 / 2266 » Timed Branching Processes |
118
click to vote
CDES
2006
15 years 3 months ago
2006
Recently, several loop buffer designs have been proposed to reduce instruction fetch energy due to size and location advantage of loop buffer. Nevertheless, on design complexity di...
123
click to vote
IPL
2006
15 years 1 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
SAT
2004
Springer
15 years 7 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
113
Voted
FASE
2003
Springer
15 years 7 months ago
2003
Springer
Scenarios are powerful tools to model and analyze software systems. However, since they do not provide a complete description of the system, but just some possible execution paths,...
110
click to vote
CGO
2006
IEEE
15 years 5 months ago
2006
IEEE
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensiv...