Algorithm portfolio selection as a bandit problem with unbounded losses

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Algorithm portfolio selection as a bandit problem with unbounded losses
Authors
Keywords
-
Journal
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
Volume 61, Issue 2, Pages 49-86
Publisher
Springer Nature
Online
2011-03-31
DOI
10.1007/s10472-011-9228-z
References
View 1 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.