Sciweavers

Share
GECCO
2005
Springer
10 years 5 months ago
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
Jason M. Daida, Michael E. Samples, Matthew J. Byo...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
10 years 5 months ago
Optimization of passenger car design for the mitigation of pedestrian head injury using a genetic algorithm
The problem of pedestrian injury is a significant one throughout the world. In 2001, there were 4724 pedestrian fatalities in Europe and 4882 in the US. Significant advances have ...
Emma Carter, Steve Ebdon, Clive Neal-Sturgess
GECCO
2005
Springer
111views Optimization» more  GECCO 2005»
10 years 5 months ago
Optimization with constraints using a cultured differential evolution approach
In this paper we propose a cultural algorithm, where different knowledge sources modify the variation operator of a differential evolution algorithm. Differential evolution is u...
Ricardo Landa Becerra, Carlos A. Coello Coello
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
10 years 5 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
10 years 5 months ago
Goal-oriented preservation of essential genetic information by offspring selection
This contribution proposes an enhanced and generic selection model for Genetic Algorithms (GAs) and Genetic Programming (GP) which is able to preserve the alleles which are part o...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
10 years 5 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
10 years 5 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
GECCO
2005
Springer
207views Optimization» more  GECCO 2005»
10 years 5 months ago
Adaptive crossover and mutation in genetic algorithms based on clustering technique
Instead of having fixed px and pm, this paper presents the use of fuzzy logic to adaptively tune px and pm for optimization of power electronic circuits throughout the process. By...
Jun Zhang, Henry Shu-Hung Chung, Jinghui Zhong
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
10 years 5 months ago
Search-based mutation testing for Simulink models
The efficient and effective generation of test-data from high-level models is of crucial importance in advanced modern software engineering. Empirical studies have shown that muta...
Yuan Zhan, John A. Clark
books