403 search results - page 72 / 81 » Sampling Bounds for Stochastic Optimization |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
TOMACS
2002
13 years 9 months ago
2002
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...