14244 search results - page 233 / 2849 » Modeling Program Predictability |
92
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
174
Voted
WOSP
1998
ACM
15 years 7 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
124
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
119
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
95
Voted
ISCA
1999
IEEE
15 years 7 months ago
1999
IEEE
Several ILP limit studies indicate the presence of considerable ILP across dynamically far-apart instructions in program execution. This paper proposes a hardware mechanism, dynam...