1298 search results - page 48 / 260 » The online set cover problem |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
92
Voted
EOR
2007
14 years 9 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
ACSD
2009
IEEE
15 years 2 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
WECWIS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
ICML
2010
IEEE
14 years 7 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...