Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989)

From MaRDI portal
Revision as of 19:08, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Algorithm portfolio selection as a bandit problem with unbounded losses
scientific article

    Statements

    Algorithm portfolio selection as a bandit problem with unbounded losses (English)
    0 references
    0 references
    0 references
    12 April 2012
    0 references
    algorithm selection
    0 references
    algorithm portfolios
    0 references
    meta learning
    0 references
    online learning
    0 references
    multi-armed bandit problem
    0 references
    survival analysis
    0 references
    Las Vegas algorithms
    0 references
    computational complexity
    0 references
    combinatorial optimization
    0 references
    constraint programming
    0 references
    satisfiability
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references