1178 search results - page 3 / 236 » An optimal adaptive algorithm for the approximation of conca... |
NIPS
2001
13 years 7 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
INFORMS
1998
13 years 6 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...