1059 search results - page 164 / 212 » Improved Algorithms via Approximations of Probability Distri... |
TWC
2008
13 years 8 months ago
2008
We propose cross-layer optimization frameworks for multihop wireless networks using cooperative diversity. These frameworks provide solutions to fundamental relaying problems of de...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...