99 search results - page 4 / 20 » Optimal Bounds on Tail Probabilities - A Simplified Approach |
INFOCOM
2010
IEEE
13 years 6 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...
SIAMJO
2008
13 years 7 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
IPCO
2007
13 years 9 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...