D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison -Wesley Publishing Company, Inc., Reading, MA, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....placement of the defined logic cell groups under the FLECHA array. Genetic Algorithm (GA) based techniques were studied and projected to perform input data pre processing in order to make use of its evolution characteristics to improve the distribution of the implemented circuit functional blocks [9]. Experimental results of this technique have demonstrated that GA can be successfully applied to VLSI global placement strategy [3] The fix FPGA internal architecture allows the employment of the same GA algorithm to optimize all IC applications. The routing phase makes the interconnection ....

Goldemberg, D.E..: Genetic Algorithms in Search, Optimization, and Machine Learnig, AddisonWesley publishing company, Inc., pp. 1-214, 1989.

....by Charles Darwin in The Origin of Species . By mimicking this process, GAs are able to evolve solutions to real word problems, if they have been suitably encoded. GA search is constrained neither by the continuity of the function under investigation, nor the existence of a derivative function [7]. Figure 2 illustrates the functional block diagram of a GA. It is assumed that a potential solution to a problem may be represented as a set of parameters. These parameters (known as genes) are joined together to form a string of values (known as a chromosome) The particular values the genes ....

Goldberg DE, Genetic Algorithms in Search, Optimization and machine learning, AddisonWesley Publishing Company, Inc., 1989.

....axon and dendrite have been made. Distributing signals Intfibitoxs: signal Figure 3: Signaling phase. 2. 3 Evolution of CAM Brain In general, simple genetic algorithm generates the population of individuals and evolves them with genetic operators such as selection, mutation, and crossover [9]. We have used the genetic algorithm to search the optimal neural network. At first, a half of the population that has better fitness value is selected to produce new population. Two individuals in the new population are randomly selected and parts of them are exchanged by one point crossoven The ....

D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, AddisonWesley Publishing Company, 1989.

.... approach to such problems because of their efficiency, generality and relative simplicity of implementation Genetic Algorithm (GA) is a powerful search algorithm based on the mechanism of natural selection and uses operations of reproduction, crossover, and mutation on a population of strings [7]. A simple GA is detailed in figure 5. A set (population) of possible solutions in this case, a coding of the various system parameters of the fuzzy logic controller can be represented as a string of typically binary numbers (or real numbers) New strings are produced every generation by the ....

Goldberg D.E., Genetic Algorithms in Search, Optimization and machine learning, AddisonWesley Publishing Company, Inc., 1989.

....nonlinear search spaces. The robustness of EA s can be primarily attributed to the population type search; since, in population based searches, solution diversity can be maintained, allowing the avoidance of local optima. The two subclasses of EA s previously mentioned, genetic algorithms (GA s [1]) and evolutionary strategies (ES s [4] both utilize a coding or parametrization of solution space to create strings genomes that are more amenable to search using evolutionary operators. GA s and ES s mainly di#er in their use of binary or real valued coding schemes, crossover or mutation as ....

Goldberg, D. E. Genetic Algorithms in Search, Optimization, and Machine Learning. AddisonWesley Publishing Company, Inc., New York, 1989.

....shape using the Euler equations. The multidisciplinary optimization problem seeks an optimal supersonic wing planform shape using linearized aerodynamics and wing weight algebraic estimation. 1 INTRODUCTION Evolutionary algorithms, Genetic Algorithms (GAs) for example, are known to be robust [1] and have been enjoying increasing popularity in the field of numerical optimization in recent years. GAs are search algorithms based on the mechanics of natural selection and natural genetics. One of the key features of GAs is that they search from a population of points and not from a single ....

....have been applied to aerodynamic optimization using Computational Fluid Dynamics (CFD) 2 5] Another advantage of GAs is their suitability to parallel processing. Since the majority of computational time will be consumed by function evaluations (CFD calculations) the simple master slave scheme [1] can be used to improve their computational efficiency. The master process controls selection, mating, and the performance of genetic operators. The slaves simply perform function evaluations. Since GAs can be parallelized more effectively than the conventional optimization methods, they will be ....

[Article contains additional citation context not shown here]

Goldberg, D. E.: Genetic Algorithms in Search, Optimization & Machine Learning, AddisonWesley Publishing Company, Inc., Reading, 1989.

....programmed into the expert system s reasoning engine, in order for the adaptation to result in feasible solutions. Instead of using this knowledge intensive approach to case adaptation, in the GENCAD project we decided to try something different, namely, to use a genetic algorithm (see [10]) The type of search that a genetic algorithm (GA) performs to explore its problem space is relatively simple, generating lots of useless solutions to the problem before converging and finding one or more adequate solutions (although GA s are not always guaranteed to converge, but that s a ....

....the separated pieces of the two genotypes to create two new genotypes. Typically, several individuals are randomly paired and combined at each cycle of a GA. Mutation does not necessarily have to be performed at each cycle of the GA (the mutation rate depends on many factors discussed in [10]) but when it does take place it implies performing a randomlychosen modification on a randomly chosen gene within one or more randomly chosen genotypes in the current population. Both combination and mutation operate blindly, randomly, and so do not need to refer to any domain knowledge in ....

Goldberg, D.E.; Genetic Algorithms in Search, Optimization, and Machine Learning, AddisonWesley Publishing Company, Inc., 1989.

....adaptation process is Darwinian natural selection and Mendelian genetics, that is elimination of weak elements by favoring retention of optimal and near optimal individuals ( survival of the fittest ) and recombination of features of good individuals to perhaps make better individuals. References [13,17] contain a theoretical analysis of a class of adaptive systems in which the search space of the problem, in our case the space of structural modifications of composite beams, is represented by sequences (strings) of symbols chosen from some alphabet (usually a binary alphabet) The searching of ....

....alphabet) The searching of this representation space is performed using so called genetic algorithms. The genetic algorithm is now widely recognized as an effective search para 3 digm in many areas. It has been used in engineering applications such as clustering [12] and pipeline optimization [13]. In the context of design, GA s have been used for: VLSI cell placement [20] floor plan design [26] air injected hydrocyclone [18] network design [10] and others. The classes of problems encountered in design include many that are difficult to solve in practice i.e. NP hard and some ....

[Article contains additional citation context not shown here]

D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison - Wesley Publishing Company, Inc., 1989.

.... easily expressed by path expressions [Ber92] It also allows the propagation of messages between objects, which can be used to enforce cardinality constraints when objects are created or deleted [Elm93] For example, consider the method delete implemented in the class Customer (in the language of [Gol83]) Customer.delete Customer instance method to delete a customer orders do: o o delete] 1) self removeFromDatabase. 2) By the above implementation, upon the deletion of a customer, the message delete is propagated (at line 1) to each related order (orders cannot exist in the ....

....that include an exception handling facility. Thus, messages not understood by an object (i.e. client) are given an exceptional treatment, so that the action bound to the corresponding exception forwards the message to the appropriate objects (i.e. parents) For example, in the Smalltalk language [Gol83], if an object cannot understand a message, the method doesNotUnderstand is activated, reporting an error. This method can be overridden when a different behavior (which, in this case, is to intercept the message and forward it to the parent objects) is needed [Bal95] Different delegation ....

GOLDBERG, A.; ROBSON, D. Smalltalk-80: The Language and its Implementation. AddisonWesley Publishing Company, 1983.

....methods, and regular objects are all abstracted by the fundamental abstraction mechanism called an Ellie object. Ellie objects are computing entities of varying sizes, e.g. finegrained, that have a state. All data items are objects on which methods are applied in a uniform way like in Smalltalk [Goldberg 89] All abstractions are first class citizens, e.g. they may be passed as parameters and assigned to names. As an example, consider the following block abstraction (closure) that when executed 3 increments the variable i and decrements the variable j: i i 1; j j 1 ] An Ellie object ....

Adele Goldberg and David Robson. Smalltalk-80: The Language. AddisonWesley Publishing Company, Massachusetts, 1989.

....of 1980s and early 1990s. Although the key OOP concepts of information hiding, data abstraction, dynamic binding and inheritance have been available in various languages (both together or separately) for many years the increased availability of OOP languages (for example SIMULA [4] and Smalltalk [5]) and OOP extended languages (for example C and Object Pascal [6] have led to the wider use of OOP techniques and methodology. During this same period there has been a renaissance in neural network technology, with the development of new and improved algorithms (for example back propagation ....

A. Goldberg and D. Robson. Smalltalk-80: The language and its implementation. AddisonWesley Publishing Company, 1983. 0-201-11371-6.

.... Population Replacement The generational replacement genetic algorithm (GRGA) replaces the entire population each generation by their offspring and is the traditional genetic algorithm defined by Holland [17] The hope is that the offspring of the best strings carry the important building blocks [12] from the best strings forward to the next generation. The GRGA, however, allows the possibility that the best strings in the population do not survive to the next generation. Also, as pointed out by Davis [6] some of the best strings may not be allocated any reproductive trials. It is also ....

....of set partitioning, however, the choice of i provides no such bound, and the GA may find infeasible solutions more attractive than feasible ones. 2.4 GA Operators The primary GA operators are selection, crossover, and mutation. We choose strings for reproduction via binary tournament selection [12, 13]. Two strings were chosen randomly from the population, and the fitter string was allocated a reproductive trial. To produce an offspring we held two binary tournaments, each of which produced one parent string. These two parent strings were then recombined to produce an offspring. The crossover ....

D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. AddisonWesley Publishing Company, Inc., New York, 1989.

....clauses can be preceded by an arbitrary sequence of modal operators, we can generalize module definitions 2[m i ]D above as follows: 2[m i ]2[m j ]D where the module m j is defined locally to m i , and it becomes visible whenever m i is entered. Example 5. 3 (Dictionary) This example (from [27]) shows how we can use nested modules to define a dictionary of pairs (name, value) with two possible implementations: one, named fast, which makes use of a search tree and is needed for big dictionaries, where fast access is important, and another one, named small, which makes use of a list and ....

A. Goldberg and D. Robson. Smalltalk-80 The Language and its Implementation. AddisonWesley Publishing Company, 1983.

....application framework consists of abstract and concrete classes that together form a theory on how to build applications and their user interface. Among the earliest examples of object oriented application frameworks was the Smalltalk Model View Controller framework (Krasner et al. 1988) (Goldberg et al. 1989)(Lalonde et al. 1991) Other examples are MacApp (Schmucker, 1986) and InterViews (Linton et al. 1989) Since application frameworks are expressed as object oriented skeleton programs, standard object oriented techniques such as refinement by inheritance can be applied to it. A skeleton can be ....

....the following paragraphs we will discuss some important UIMSs and match them to the above criteria. Afterwards we will tentatively define a purified application framework and associated UIB. 3. 1 The Model View Controller Framework The Model View Controller (MVC) framework (Krasner et al. 1988)(Goldberg et al. 1989)(Lalonde et al. 1991) can not be omitted from this overview, as it is generally regarded as being one of the first object oriented frameworks (Johnson et al. 1988) Johnson et al. 1991) Its main contribution was the distinction between three important roles (namely data, output and input) that ....

A. Goldberg, and D. Robson. Smalltalk-80, The Language. AddisonWesley Publishing Company, Reading Massachusetts, 1989.

....function has been changed so that it would only update the value of the chromosome instead of completely evaluating the solution. The selection method used in the second implementation Table 5 is a deterministic method rather than the stochastic method based on roulette wheel parent selection [9]. Table 6 presents solutions (partitions) based on the second representation method (permutation with separators) Since all solutions that evolve using this representation scheme are feasible, the computation time has decreased with respect to the first computational Genetic Algorithm ....

D.E. Goldberg, Genetic algorithms in search, optimization, and machine learning, AddisonWesley Publishing Company, Inc, Reading, Massachusetts, 1989.

....of scheduling problems where optimal solutions are too costly to produce. Our genetic algorithm consists of a population of strings called chromosomes C, an evaluation function called a fitness function E(C) and a life cycle consisting of three operators: reproduction, crossover, and mutation [5]. The basic premise of the genetic algorithm is that solutions to a problem are coded in the chromosomes and each of these chromosomes are evaluated based on the fitness function. The chromosomes with the higher fitness values are selected for reproduction to the next generation. These selected ....

D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. AddisonWesley Publishing Company, 1989.

....view [project project name ] owner owner name ] condition condition ] condition : Smalltalk block expression As seen, all parts project name , owner name and condition are optional. Objects satisfying the specification are selected as the result. The condition is a Smalltalk [GoRo83] block expression which for each argument object returns a boolean value. The examined object is identified by the predefined variable self, as shown in the following example: define view project VIEW owner fujita condition [self class = Folder] The same language is used for an action view. ....

A. Goldberg, D. Robson. Smalltalk-80 -- The Language and its Implementation. AddisonWesley Publishing Company, 1983.

....template (EHBSA WT) are presented. The results were tested in the TSP and showed EHBSA WT worked fairly well with a small population size in the test problems used. It also worked better than well known traditional two parent recombination operators. 1 Introduction Genetic Algorithms (GAs) Goldberg 89] are widely used as robust searching schemes in various real world applications, including function optimization, optimum scheduling, and many combinatorial optimization problems. Traditional GAs start with a randomly generated population of candidate solutions (individuals) From the current ....

....pr76. The gr24 and gr48 are used in the study of TSP with EDA in [Robles 02] We compared EHBSA with popular order based recombination operators, namely, the original order crossover OX [Oliver 87] the enhanced edge recombination operator eER [Starkweather 91] and the partially mapped crossover [Goldberg 89] We also tried to compare EHBSA with results in [Robles 02] on gr24 and gr48. Ten runs were performed. Each run continued until the optimum tour was found, the population was con verged, or evaluations reached Emax Values of Emax were 50000, 500000, and 1000000 for gr24, gr48, and pr76, ....

Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning, Addi- son-Wesley publishing company (1989).

No context found.

D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison -Wesley Publishing Company, Inc., Reading, MA, 1989.

No context found.

D.E. Goldberg. Genetic algorithms in search, optimization, and machine learning. AddisonWesley Publishing Company, Inc., 1989.

No context found.

D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. AddisonWesley Publishing Company, Inc., Reading, MA, 1989.

No context found.

D. E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. AddisonWesley Publishing Company, Inc., Reading, MA, 1989. Reprinted with corrections.

No context found.

A. Goldberg and D. Robson. Smalltalk-80 The Language and its Implementation. AddisonWesley Publishing Company, 1983.

No context found.

D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. AddisonWesley Publishing Company, Inc., Menlo Park, CA, 1989.

No context found.

Goldberg, A. and Robson, D. Smalltalk-80: The Language and its Implementation. AddisonWesley Publishing Company, 1983.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC