3475 search results - page 133 / 695 » Backbones in Optimization and Approximation |
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
165
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Efficient design of wireless networks requires implementation of cross-layer algorithms that exploit channel state information. Capitalizing on convex optimization and stochastic...
169
click to vote
JORS
2011
2011
Robust parameter design optimization of simulation experiments using stochastic perturbation methods
15 years 1 months ago
Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simula...
176
click to vote
CISS
2008
IEEE
16 years 25 days ago
2008
IEEE
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
144
click to vote
SIGECOM
2005
ACM
15 years 12 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...