945 search results - page 6 / 189 » Incremental Branching Programs |
HIPEAC
2007
Springer
14 years 1 months ago
2007
Springer
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today...
IEEEPACT
2003
IEEE
14 years 27 days ago
2003
IEEE
In this paper, we study the effects of manipulating the architected direction of conditional branches. Through the use of statistical sampling, we find that about 40% of all dyna...
COR
2006
13 years 7 months ago
2006
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
MICRO
1994
IEEE
13 years 11 months ago
1994
IEEE
: Program profiles identify frequently executed portions of a program, which are the places at which optimizations offer programmers and compilers the greatest benefit. Compilers, ...