Results 311 to 320 of about 321,863 (350)
Some of the next articles are maybe not open access.
Directed Evolutionary Programming: Towards an Improved Performance of Evolutionary Programming
2006 IEEE International Conference on Evolutionary Computation, 2006Evolutionary programming (EP) is one of the main classes of evolutionary algorithms (EAs). Improving existing EAs is necessary in order to achieve better results and overcome their costly computational complexity. In this paper, we present a new version of EP called Directed Evolutionary Programming (DEP) in which more directing strategies with learned
Masao Fukushima, Abdel-Rahman Hedar
openaire +2 more sources
An Efficient Evolutionary Programming
2008 International Symposium on Information Science and Engineering, 2008Premature convergence is the fatal shortcoming of traditional evolutionary programming. In this paper, based on the analysis of traditional evolutionary programming premature convergence, an improved multi-subgroup evolutionary programming (MEP) algorithm is proposed. In this algorithm, evolution of many subgroups is paralleled performed with different
Ji Dou, Wang Xiangjun
openaire +2 more sources
A modified evolutionary programming
Proceedings of IEEE International Conference on Evolutionary Computation, 2002In this paper, a new modified method based on guided evolutionary programming is proposed. The Cauchy distribution is used to replace the Gaussian distribution for creating offspring from their parents. The experiment results show that the modified evolutionary programming is a fast global optimization technique.
Chengjian Wei, Zhenya He, Susu Yao
openaire +2 more sources
Revisiting evolutionary programming
SPIE Proceedings, 1998Evolutionary programming is a method for simulating evolution that has been investigated for almost 40 years. When originally introduced, the available computing equipment was quite slow and difficult to use as measured by current standards. This paper provides a series of experiments that follow the framework of the original approach from the early ...
Kumar Chellapilla, David B. Fogel
openaire +2 more sources
[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, 2002
A brief review of efforts is simulated evolution is given. Evolutionary programming is a stochastic optimization technique that is useful for discovering the extrema of a nonlinear function. To implement such a search, several high-level parameters must be chosen, such as the amount of mutational noise, the severity of the mutation noise, and so forth.
J. W. Atmar, David B. Fogel, L.J. Fogel
openaire +2 more sources
A brief review of efforts is simulated evolution is given. Evolutionary programming is a stochastic optimization technique that is useful for discovering the extrema of a nonlinear function. To implement such a search, several high-level parameters must be chosen, such as the amount of mutational noise, the severity of the mutation noise, and so forth.
J. W. Atmar, David B. Fogel, L.J. Fogel
openaire +2 more sources
Parallel evolutionary programming
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2005This work presents a study of parallel evolutionary programming (EP). The paper is divided into two parts. The first part proposes a concept of parallel EP. Four numerical functions are used to compare the performance between the serial algorithm and the parallel algorithm.
Shisanu Tongchim, Xin Yao
openaire +2 more sources
The Future of Evolutionary Programming [PDF]
1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, 1990., 2005 Evolutionary programming was conceived in I960 as an alternative approach to artificial intelligence. The initial applica+ tions concerned prediction, modeling, and the control of unknown processes with respect to an arbitrary payoff function. Future applications take the form of hierarchic evolutionary programming wherein higher levels evolve optinial
openaire +1 more source
Evolutionary programming to optimize an assembly program
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2003Evolutionary programming was used to attempt to optimize a program written in the pseudo-assembly language Redcode, invented by A.K. Dewdney. Corewars is the game under which Redcode programs compete. Since 1994, the last standardization of Redcode, many complicated, effective Redcode programs have been written by people, but intense study is required ...
Donald C. Wunsch, Brian Blaha
openaire +2 more sources
Evolutionary Program Sketching
2017Program synthesis can be posed as a satisfiability problem and approached with generic SAT solvers. Only short programs can be however synthesized in this way. Program sketching by Solar-Lezama assumes that a human provides a partial program (sketch), and that synthesis takes place only within the uncompleted parts of that program.
Krzysztof Krawiec, Iwo Błądek
openaire +2 more sources
Evolutionary dynamics of evolutionary programming in noisy environment
Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), 2002The effect of noise on the evolutionary dynamics of evolutionary programming (EP) is empirically observed using three different statistical values. These are: (1) the averaged best function values, (2) the average of the strategy parameters, and (3) Hotelling's T/sup 2/ of real values. The classical EP (CEP) of D.B. Fogel (1995), the fast EP (FEP) of X.
Kanji Ueda +2 more
openaire +2 more sources