期刊名称：International Journal of Interactive Multimedia and Artificial Intelligence
印刷版ISSN：1989-1660
出版年度：2016
卷号：3
页码：81-86
DOI：10.9781/ijimai.2016.3713
出版社：ImaI-Software
摘要：In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s) of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.
Loading...
