Sciweavers

212 search results - page 17 / 43
» Optimal sampling of genetic algorithms on polynomial regress...
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 4 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 3 months ago
A genetic algorithm for learning significant phrase patterns in radiology reports
Radiologists disagree with each other over the characteristics and features of what constitutes a normal mammogram and the terminology to use in the associated radiology report. R...
Robert M. Patton, Thomas E. Potok, Barbara G. Beck...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 5 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
ICANNGA
2009
Springer
212views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
Evolutionary Regression Modeling with Active Learning: An Application to Rainfall Runoff Modeling
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Ivo Couckuyt, Dirk Gorissen, Hamed Rouhani, Eric L...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 5 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld