Sciweavers

602 search results - page 68 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
ICSM
2006
IEEE
14 years 5 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
14 years 7 days ago
A robust evolutionary framework for multi-objective optimization
Evolutionary multi-objective optimization (EMO) methodologies, suggested in the beginning of Nineties, focussed on the task of finding a set of well-converged and well-distribute...
Kalyanmoy Deb
SOFTCO
2004
Springer
14 years 4 months ago
Designing Neural Networks Using Gene Expression Programming
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
Cândida Ferreira
SIAMJO
2011
13 years 2 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
AIR
2005
122views more  AIR 2005»
13 years 11 months ago
The Genetic Kernel Support Vector Machine: Description and Evaluation
The Support Vector Machine (SVM) has emerged in recent years as a popular approach to the classification of data. One problem that faces the user of an SVM is how to choose a kerne...
Tom Howley, Michael G. Madden