1279 search results - page 137 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
128
click to vote
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
137
click to vote
AI
2002
Springer
15 years 1 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
125
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
102
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...