@inproceedings{b35b500fcb844abdb52604129b16ce34,
title = "Service-oriented volunteer computing for massively parallel constraint solving using portfolios",
abstract = "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]).",
author = "Zeynep Kiziltan and Jacopo Mauro",
year = "2010",
month = aug,
day = "16",
doi = "10.1007/978-3-642-13520-0_27",
language = "English",
isbn = "3642135196",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science+Business Media",
pages = "246--251",
booktitle = "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 7th International Conference, CPAIOR 2010, Proceedings",
note = "7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2010 ; Conference date: 14-06-2010 Through 18-06-2010",
}