Recent years have witnessed growing interest in parallelising constraint solving based on tree search (see [1] for a brief overview). One approach is search-space splitting in which different parts of the tree are explored in parallel (e.g. [2]). Another approach is the use of algorithm portfolios. This technique exploits the significant variety in performance observed between different algorithms and combines them in a portfolio [3]. In constraint solving, an algorithm can be a solver or a tuning of a solver. Portfolios have often been run in an interleaving fashion (e.g. [4]). Their use in a parallel context is more recent ([5], [1]). © 2010 Springer-Verlag.
CITATION STYLE
Kiziltan, Z., & Mauro, J. (2010). Service-oriented volunteer computing for massively parallel constraint solving using portfolios. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6140 LNCS, pp. 246–251). https://doi.org/10.1007/978-3-642-13520-0_27
Mendeley helps you to discover research relevant for your work.