Sciweavers

3038 search results - page 133 / 608
» High-Speed Function Approximation
Sort
View
151
Voted
MP
2002
176views more  MP 2002»
15 years 4 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 11 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
PAMI
2011
14 years 12 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
ATAL
2007
Springer
15 years 11 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
WSC
2008
15 years 7 months ago
A rate result for simulation optimization with conditional value-at-risk constraints
We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the co...
Soumyadip Ghosh