7930 search results - page 264 / 1586 » Greedy in Approximation Algorithms |
144
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose a fast algor...
164
click to vote
WINE
2007
Springer
16 years 20 days ago
2007
Springer
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
165
click to vote
WAOA
2005
Springer
16 years 1 days ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
216
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
147
click to vote
AAAI
2006
15 years 8 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...