Learning Static Parallel Portfolios of Algorithms

@unpublished{Petrik2006Learninga, abstract = {We present an approach for improving the performance of combinatorial optimization algorithms by generating an optimal Parallel Portfolio of Algorithms (PPA). A PPA is a collection of diverse algorithms for solving a single problem, all running concurrently on a single processor until a solution is produced. The performance of the portfolio may be controlled by assigning di\#erent shares of processor time to each algorithm. We present a method for finding a static PPA, in which the share of ...}, author = {Petrik, Marek and Zilberstein, Shlomo }, booktitle = {Ninth International Symposium on Artificial Intelligence and Mathematics}, citeulike-article-id = {2106186}, keywords = {algorithm-portfolios, algorithm-selection, parallel-computing, printed, static}, month = {January}, posted-at = {2007-12-13 18:37:13}, priority = {2}, title = {Learning Static Parallel Portfolios of Algorithms}, url = {http://citeseer.ist.psu.edu/738917.html}, year = {2006} }

TY - UNPB ID - Petrik2006Learninga L3 - citeulike-article-id:2106186 TI - Learning Static Parallel Portfolios of Algorithms T2 - Ninth International Symposium on Artificial Intelligence and Mathematics N2 - We present an approach for improving the performance of combinatorial optimization algorithms by generating an optimal Parallel Portfolio of Algorithms (PPA). A PPA is a collection of diverse algorithms for solving a single problem, all running concurrently on a single processor until a solution is produced. The performance of the portfolio may be controlled by assigning di#erent shares of processor time to each algorithm. We present a method for finding a static PPA, in which the share of ... KW - algorithm-portfolios KW - algorithm-selection KW - parallel-computing KW - printed KW - static AU - Petrik, Marek AU - Zilberstein, Shlomo PY - 2006/January// UR - http://citeseer.ist.psu.edu/738917.html ER -