110 search results - page 11 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
129
click to vote
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
119
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
159
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
141
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
140
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...