Results 1  10
of
40
An Indexed Bibliography of Genetic Algorithms in Power Engineering
, 1995
"... s: Jan. 1992  Dec. 1994 ffl CTI: Current Technology Index Jan./Feb. 1993  Jan./Feb. 1994 ffl DAI: Dissertation Abstracts International: Vol. 53 No. 1  Vol. 55 No. 4 (1994) ffl EEA: Electrical & Electronics Abstracts: Jan. 1991  Dec. 1994 ffl P: Index to Scientific & Technical Proceed ..."
Abstract

Cited by 90 (10 self)
 Add to MetaCart
s: Jan. 1992  Dec. 1994 ffl CTI: Current Technology Index Jan./Feb. 1993  Jan./Feb. 1994 ffl DAI: Dissertation Abstracts International: Vol. 53 No. 1  Vol. 55 No. 4 (1994) ffl EEA: Electrical & Electronics Abstracts: Jan. 1991  Dec. 1994 ffl P: Index to Scientific & Technical Proceedings: Jan. 1986  Feb. 1995 (except Nov. 1994) ffl EI A: The Engineering Index Annual: 1987  1992 ffl EI M: The Engineering Index Monthly: Jan. 1993  Dec. 1994 The following GA researchers have already kindly supplied their complete autobibliographies and/or proofread references to their papers: Dan Adler, Patrick Argos, Jarmo T. Alander, James E. Baker, Wolfgang Banzhaf, Ralf Bruns, I. L. Bukatova, Thomas Back, Yuval Davidor, Dipankar Dasgupta, Marco Dorigo, Bogdan Filipic, Terence C. Fogarty, David B. Fogel, Toshio Fukuda, Hugo de Garis, Robert C. Glen, David E. Goldberg, Martina GorgesSchleuter, Jeffrey Horn, Aristides T. Hatjimihail, Mark J. Jakiela, Richard S. Judson, Akihiko Konaga...
Promises and Challenges of Evolvable Hardware
, 1996
"... Evolvable hardware (EHW) has attracted increasing attention since early 1990's with the advent of easily reconfigurable hardware such as field programmable gate arrays (FPGAs). It promises to provide an entirely new approach to complex electronic circuit design and new adaptive hardware. EHW ha ..."
Abstract

Cited by 88 (5 self)
 Add to MetaCart
Evolvable hardware (EHW) has attracted increasing attention since early 1990's with the advent of easily reconfigurable hardware such as field programmable gate arrays (FPGAs). It promises to provide an entirely new approach to complex electronic circuit design and new adaptive hardware. EHW has been demonstrated to be able to perform a wide range of tasks from pattern recognition to adaptive control. However, there are still many fundamental issues in EHW which remain open. This paper reviews the current status of EHW, discusses the promises and possible advantages of EHW, and indicates the challenges we must meet in order to develop practical and largescale EHW. 1 Introduction Evolvable hardware (EHW) refers to hardware that can change its architecture and behaviour dynamically and autonomously by interacting with its environment. At present, almost all EHW uses an evolutionary algorithm (EA) as their main adaptive mechanism. One of the key motivations behind EHW is to learn from N...
Schema Theory for Genetic Programming with Onepoint Crossover and Point Mutation
 Evolutionary Computation
, 1998
"... We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is closer to the original concept of schema in genetic algorithms (GAs). Along with ..."
Abstract

Cited by 76 (31 self)
 Add to MetaCart
(Show Context)
We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, onepoint crossover, and point mutation this concept of schema has been used to derive an improved schema theorem for GP which describes the propagation of schemata from one generation to the next. We discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges. 1 Introduction Genetic Programming (GP) has been applied successfully to a large number of difficult problems like automatic design, pattern recognition, robotic control, synthesis on neural architectures, symbolic regression, music and picture generation [2, 9, 10, 11, 12, 13]. However a relatively small numbe...
A New Schema Theory for Genetic Programming with Onepoint Crossover and Point Mutation
 Genetic Programming 1997: Proceedings of the Second Annual Conference
, 1997
"... In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is quite close to the original concept of schema in genetic ..."
Abstract

Cited by 61 (37 self)
 Add to MetaCart
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is quite close to the original concept of schema in genetic algorithms (GAs).
General Schema Theory for Genetic Programming with SubtreeSwapping Crossover
 In Genetic Programming, Proceedings of EuroGP 2001, LNCS
, 2001
"... In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. A more macroscopic schema ..."
Abstract

Cited by 53 (30 self)
 Add to MetaCart
(Show Context)
In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. A more macroscopic schema theorem is also provided which is valid for crossover operators in which the probability of selecting any two crossover points in the parents depends only on their size and shape. The theory is based on the notions of Cartesian node reference systems and variablearity hyperschemata both introduced here for the first time. In the paper we provide examples which show how the theory can be specialised to specific crossover operators and how it can be used to derive an exact definition of effective fitness and a sizeevolution equation for GP. 1
An Analysis of the MAX Problem in Genetic Programming
 Advances in Genetic Programming 3, chapter 13
, 1997
"... We present a detailed analysis of the evo lution of genetic programming ((P) popu lations using the problem of finding a program which returns the maximum possible value for a given terminal and function set and a depth limit on the program tree (known as the MAX problem). We confirm the ba ..."
Abstract

Cited by 37 (11 self)
 Add to MetaCart
We present a detailed analysis of the evo lution of genetic programming ((P) popu lations using the problem of finding a program which returns the maximum possible value for a given terminal and function set and a depth limit on the program tree (known as the MAX problem). We confirm the basic message of [Gathercole and Ross, 1996] that crossover together with program size restrictions can be responsible for premature convergence to a suboptimal solution. We show that this can happen even when the population retains a high level of variety and show that in many cases evolution from the suboptimal solution to the solution is possible if sufficient time is allowed. In both cases theoretical models are presented and compared with actual runs.
Exact Schema Theory for Genetic Programming and Variablelength Genetic Algorithms with OnePoint Crossover
, 2001
"... A few schema theorems for Genetic Programming (GP) have been proposed in the literature in the last few years. Since they consider schema survival and disruption only, they can only provide a lower bound for the expected value of the number of instances of a given schema at the next generation rathe ..."
Abstract

Cited by 37 (16 self)
 Add to MetaCart
A few schema theorems for Genetic Programming (GP) have been proposed in the literature in the last few years. Since they consider schema survival and disruption only, they can only provide a lower bound for the expected value of the number of instances of a given schema at the next generation rather than an exact value. This paper presents theoretical results for GP with onepoint crossover which overcome this problem. Firstly, we give an exact formulation for the expected number of instances of a schema at the next generation in terms of microscopic quantities. Thanks to this formulation we are then able to provide an improved version of an earlier GP schema theorem in which some (but not all) schema creation events are accounted for. Then, we extend this result to obtain an exact formulation in terms of macroscopic quantities which makes all the mechanisms of schema creation explicit. This theorem allows the exact formulation of the notion of effective fitness in GP and opens the way to future work on GP convergence, population sizing, operator biases, and bloat, to mention only some of the possibilities.
Exact schema theorem and effective fitness for GP with onepoint crossover
 Proceedings of the Genetic and Evolutionary Computation Conference, pages 469476, Las Vegas
, 2000
"... This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with onepoint crossover. This gives an exact expression for the expected number of instances of a schema at the next generation in terms of macroscopic quantities. This result allows the ex ..."
Abstract

Cited by 32 (17 self)
 Add to MetaCart
(Show Context)
This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with onepoint crossover. This gives an exact expression for the expected number of instances of a schema at the next generation in terms of macroscopic quantities. This result allows the exact formulation of the notion of effective fitness in GP. 1
Genetic Programming with OnePoint Crossover and Point Mutation
 Soft Computing in Engineering Design and Manufacturing
, 1997
"... In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs. We call this operator onepoint crossover because of its similarity with the corresponding operator ..."
Abstract

Cited by 27 (14 self)
 Add to MetaCart
In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs. We call this operator onepoint crossover because of its similarity with the corresponding operator in genetic algorithms. One point crossover presents very interesting properties from the theory point of view. In this paper we describe this form of crossover as well as a new variant called strict onepoint crossover highlighting their useful theoretical and practical features. We also present experimental evidence which shows that onepoint crossover compares favourably with standard crossover.
Hyperschema Theory for GP with OnePoint Crossover, Building Blocks, and Some New Results in GA Theory
 Genetic Programming, Proceedings of EuroGP 2000
, 2000
"... Two main weaknesses of GA and GP schema theorems axe that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H,t + 1)], and they can only give a lower bound for such a quantity. This paper presents new theoretical results o ..."
Abstract

Cited by 27 (18 self)
 Add to MetaCart
(Show Context)
Two main weaknesses of GA and GP schema theorems axe that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H,t + 1)], and they can only give a lower bound for such a quantity. This paper presents new theoretical results on GP and GA schemata which laxgely overcome these weaknesses. Firsfly, unlike previous results which concentrated on schema survival and disruption, our results extend to GP recent work on GA theory by Stephens and Waelbroeck, and make the effects and the mechanisms of schema creation explicit. This allows us to give an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. Thanks to this formulation we are then able to provide in improved version for an eaxlier GP schema theorem in which some schema creation events axe accounted for, thus obtaining a tighter bound for E[m(H, t + 1)]. This bound is a function of the selection probabilities of the schema itself and of a set of lowerorder schemata which onepoint crossover uses to build instances of the schema. This result supports the existence of building blocks in GP which, however, axe not necessaxily all short, loworder or highly fit. Building on eaxlier work, we show how Stephens and Waelbroeck 's GA results and the new GP results described in the paper can be used to evaluate schema vaxiance, signaltonoise ratio and, in general, the probability distribution of re(H, t + 1). In addition, we show how the expectation operator can be removed from the schema theorem so as to predict with a known probability whether re(H, t + 1) (rather than Elm(H, t + 1)]) is going to be above a given threshold.