Sciweavers

191 search results - page 38 / 39
» Generating Heap-Bounded Programs in a Functional Setting
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
13 years 11 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 6 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
RECOMB
2009
Springer
14 years 22 days ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 3 days ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
HPCC
2007
Springer
14 years 3 days ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham