64 search results - page 3 / 13 » Adaptive Overrelaxed Bound Optimization Methods |
127
click to vote
CORR
2011
Springer
14 years 10 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...
156
click to vote
OPODIS
2010
15 years 1 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
110
click to vote
AAAI
1998
15 years 4 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
207
Voted
SIAMIS
2011
14 years 10 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
127
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...