Algorithm Portfolios

Algorithm portfolio methods operate in problem domains for which there are multiple algorithms with complementary strengths. The portfolio method applies patterns learned from experience to better allocate computational resources among the algorithms, attempting to apply each algorithm primarily to those problem instances to which it is best suited. Applications of the methods developed in this work include SAT and answer set programming.

A Probabilistic Architecture for Algorithm Portfolios | 2012 |

Bryan Silverthorn, PhD Thesis, Department of Computer Science, The University of Texas at Austin. | |

Surviving Solver Sensitivity: An ASP Practitioner's Guide | 2012 |

Bryan Silverthorn, Yuliya Lierler and Marius Schneider, International Conference on Logic Programming (ICLP) (2012). | |

Latent Class Models for Algorithm Portfolio Methods | 2010 |

Bryan Silverthorn and Risto Miikkulainen, In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence 2010. |