Sciweavers

5785 search results - page 557 / 1157
» Approximability of Probability Distributions
Sort
View
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 12 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
SIGECOM
2011
ACM
170views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Only valuable experts can be valued
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...
Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert...
MOBIHOC
2009
ACM
16 years 7 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
MOBICOM
2004
ACM
16 years 14 days ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
MOBICOM
2004
ACM
16 years 14 days ago
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
One key usage of VANET is to support vehicle safety applications. This use case is characterized by the prominence of broadcasts in scaled settings. In this context, we try to ans...
Marc Torrent-Moreno, Daniel Jiang, Hannes Hartenst...