109 search results - page 9 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
ORL
1998
13 years 7 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
ICDM
2003
IEEE
14 years 20 days ago
2003
IEEE
In the literature of data mining, many different algorithms for association rule mining have been proposed. However, there is relatively little study on how association rules can ...