5785 search results - page 136 / 1157 » Approximability of Probability Distributions |
114
Voted
MANSCI
2008
15 years 3 months ago
2008
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
135
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
141
Voted
INFOCOM
2012
IEEE
13 years 6 months 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...
137
click to vote
ISIPTA
2005
IEEE
15 years 9 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
137
Voted
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
—The performance of a cooperative network with Cooperative Maximal Ratio Combining (C-MRC) is analyzed. To this end, we propose a heuristic approximation to the total received SN...