77 search results - page 7 / 16 » A New Exchange Method for Convex Semi-Infinite Programming |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity ...
JMLR
2006
13 years 7 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...