109 search results - page 14 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
HICSS
2003
IEEE
14 years 20 days ago
2003
IEEE
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
MA
2010
Springer
13 years 5 months ago
2010
Springer
: Semiparametric linear transformation models have received much attention due to its high flexibility in modeling survival data. A useful estimating equation procedure was recent...
IJSNET
2008
13 years 7 months ago
2008
: Interference from colocated networks operating over the same frequency range, becomes an increasingly severe problem as the number of networks overlapping geographically increase...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...