Combining Multiple Constraint Solvers: Results on the CPAI’06 Competition Data
Workshop Paper, 13th International Conference on Principles and Practice of Constraint Programming (CP '07) Constraint Solver Competition (CPAI '07), September, 2007
Abstract
In a recent paper [5], we presented an algorithm that constructs a schedule for interleaving the execution of two or more solvers, with the goal of obtaining improved average-case running time relative to the fastest individual solver. In this paper, we evaluate this algorithm experimentally using data from the CPAI’06 constraint solver competition.
BibTeX
@workshop{Streeter-2007-120522,author = {M. Streeter and D. Golovin and S. F. Smith},
title = {Combining Multiple Constraint Solvers: Results on the CPAI’06 Competition Data},
booktitle = {Proceedings of 13th International Conference on Principles and Practice of Constraint Programming (CP '07) Constraint Solver Competition (CPAI '07)},
year = {2007},
month = {September},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.