7006 search results - page 86 / 1402 » Approximation Algorithms |
148
click to vote
WINE
2010
Springer
15 years 6 days ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
112
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
152
Voted
INFOCOM
2010
IEEE
15 years 24 days ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
135
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
143
Voted
NPAR
2000
ACM
15 years 6 months ago
2000
ACM
This paper presents a new method for the automatic painterly rendering. This method synthesizes an impressive image with a handcrafted look from a source image such as a photograp...