Sciweavers

1157 search results - page 108 / 232
» Solving iterated functions using genetic programming
Sort
View
LOPSTR
2004
Springer
15 years 9 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
TAPSOFT
1997
Springer
15 years 8 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
PPSN
1998
Springer
15 years 8 months ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley
BMCBI
2004
158views more  BMCBI 2004»
15 years 3 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 10 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...