1298 search results - page 87 / 260 » The online set cover problem |
185
click to vote
JMLR
2010
15 years 1 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
351
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
183
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
185
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
149
click to vote
ICAC
2007
IEEE
16 years 22 days ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...