1298 search results - page 42 / 260 » The online set cover problem |
NIPS
2004
14 years 11 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
87
Voted
JMLR
2010
14 years 4 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
CVPR
2012
IEEE
13 years 3 days ago
2012
IEEE
In this paper, we address a practical problem of crossscenario clothing retrieval - given a daily human photo captured in general environment, e.g., on street, finding similar cl...
109
click to vote
MST
2010
14 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
82
Voted
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...