455 search results - page 42 / 91 » Approximation Algorithms for Partial Covering Problems |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
104
Voted
PODS
2003
ACM
15 years 9 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
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...