602 search results - page 46 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
AE
2003
Springer
15 years 2 months ago
2003
Springer
In this work we study how using multiple communicating populations instead of a single panmictic one may help in maintaining diversity during GP runs. After defining suitable geno...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...
105
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and ...