September
2007
Combining Multiple Constraint Solvers: Results on the CPAI’06 Competition Data
Authors:
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.
copied = false, 2000);
">
@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},
}
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},
}