Boosting As a Metaphor for Algorithm Design
K. G. Subramanian · International Journal of Innovative Research in Computer and Communication Engineering · 2013
Although some algorithms are better than others on average, there is rarely a best algorithm for a given problem. Instead, different algorithms often perform well on algorithms for solving NP-hard problems, when run times are highly variable from instance to instance. When algorithms exhibit high run time variance, one is faced with the problem of deciding which algorithm is to be used.