1071 search results - page 98 / 215 » An Experimental Study of Benchmarking Functions for Genetic ... |
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. To improve the efficiency of the currently known evolutionary algorithms, we have proposed two complementary efficiency speed-up strategies in our previous research work ...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
JMLR
2002
13 years 8 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
ISCI
2008
13 years 8 months ago
2008
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...