9787 search results - page 112 / 1958 » A Utile Function Optimizer |
COLT
2010
Springer
13 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
MOR
2006
13 years 9 months ago
2006
We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we d...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
ICCCN
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose a precomputation-based scheme which offers Pareto optimal solutions to the network dimensioning problem. This scheme is performed by means of a two-phase procedure. ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...