2698 search results - page 97 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
182
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
187
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
175
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
128
click to vote
ICDM
2006
IEEE
16 years 9 days ago
2006
IEEE
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
174
click to vote
UAI
2001
15 years 7 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...