1429 search results - page 61 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ICOIN
2004
Springer
15 years 3 months ago
2004
Springer
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
INFOCOM
2012
IEEE
13 years 7 days ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
145
click to vote
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...