248 search results - page 36 / 50 » Rate of Convergence for Constrained Stochastic Approximation... |
MP
2002
13 years 7 months ago
2002
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 ...
AAAI
2012
11 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
IDA
1998
Springer
13 years 7 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
NPL
2008
13 years 7 months ago
2008
: - This paper addresses an inverse controller design for excitation system with changing parameters and nonsmooth nonlinearities in the actuator. The existence of such nonlinearit...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Efficient and accurate fitting of Active Appearance
Models (AAM) is a key requirement for many applications.
The most efficient fitting algorithm today is Inverse Compositional
...