350 search results - page 8 / 70 » Branching Programs for Tree Evaluation |
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
EXPCS
2007
13 years 11 months ago
2007
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
IPCO
2008
13 years 9 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...