![]() |
CiteULike | ![]() |
bsilverthorn's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Towards Distributed Algorithm PortfoliosInternational Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008) In International Symposium on Distributed Computing and Artificial Intelligence (DCAI) (2008), pp. 634-643.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs.
BibTeX record
RIS record