204 search results - page 27 / 41 » Parameterized Complexity of Cardinality Constrained Optimiza... |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
AAAI
2004
13 years 8 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
DEXA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
VTC
2006
IEEE
14 years 22 days ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
WWW
2009
ACM
14 years 7 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...