315 search results - page 16 / 63 » Improving Performance by Branch Reordering |
MOBISYS
2005
ACM
14 years 8 months ago
2005
ACM
Multi-homed mobile hosts situated in physical proximity may spontaneously team up to run high-bandwidth applications by pooling their low wireless wide-area network (WWAN) bandwid...
ISCA
2000
IEEE
14 years 1 months ago
2000
IEEE
The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the “3-D” structure of banks, rows, and columns characteristi...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
In this work a branch prediction system which utilizes evolutionary techniques is introduced. It allows the predictor to adapt to the executed code and thus to improve its perform...
PATMOS
2005
Springer
14 years 2 months ago
2005
Springer
Modern embedded processors use small and simple branch predictors to improve performance. Using complex and accurate branch predictors, while desirable, is not possible as such pre...
AAAI
1996
13 years 10 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...