113 search results - page 8 / 23 » Optimal Hardness Results for Maximizing Agreements with Mono... |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
FOCS
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
ICPP
1998
IEEE
13 years 11 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
– This paper addresses the problem of resource allocation in a multiservice optical network based on an Overlapped-CDMA system. A joint transmission power and overlapping coeffic...