248 search results - page 36 / 50 » Rate of Convergence for Constrained Stochastic Approximation... |
119
Voted
MP
2002
15 years 1 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 ...
124
Voted
AAAI
2012
13 years 4 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...
104
click to vote
IDA
1998
Springer
15 years 1 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...
104
click to vote
NPL
2008
15 years 1 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...
152
click to vote
CVPR
2009
IEEE
16 years 9 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
...