641 search results - page 3 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
ICS
2009
Tsinghua U.
13 years 5 months ago
2009
Tsinghua U.
Modern processors require highly accurate branch prediction for good performance. As such, a number of branch predictors have been proposed with varying size and complexity. This ...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
Although high branch prediction accuracy is necessary for high performance, it typically comes at the cost of larger predictor tables and/or more complex prediction algorithms. Un...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
AIPS
2006
13 years 8 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
CCGRID
2003
IEEE
14 years 22 days ago
2003
IEEE
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...