scientific article; zbMATH DE number 108388
Boolean multiplexer functionGenetic algorithmsgenetic searchparallel genetic algorithmreal parameter optimizationtime complexity
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Contents: Genetic Algorithm Hardness: Clayton L. Bridges and David E. Goldberg, The Nonuniform Walsh-Schema Transform (13--22); Yuval Davidor, Epistasis Variance, A Viewpoint on GA-Hardness (23--35); Gunar E. Liepins and Michael D. Vose, Deceptiveness and Genetic Algorithm Dynamics (36--50). Selection and Convergence: Carol A. Ankenbrandt, An Extension to the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms (53--68); David E. Goldberg and Kalyanmoy Deb, A Comparative Analysis of Selection Schemes Used in Genetic Algorithms (69--93); Gilbert Syswerda, A Study of Reproduction in Generational and Steady State Genetic Algorithms (94--101); J. David Schaffer, Larry J. Eshelman and Daniel Offutt, Spurious Correlations and Premature Convergence in Genetic Algorithms (102--112). Classifier Systems: Lashon B. Booker, Representing Attribute-Based Concepts in a Classifier System (115--127); Thomas H. Westerdale, Quasimorphisms or Queasymorphisms? Modeling Finite Automaton Environments (128--147); Robert E. Smith and David E. Goldberg, Variable Default Hierarchy Separation in a Classifier System (148--167). Coding and Representation: John R. Koza, A Hierarchical Approach to Learning the Boolean Multiplexer Function (171--192); H. James Antonisse, A Grammar-Based Genetic Algorithm (193--204); Alden H. Wright, Genetic Algorithms for Real Parameter Optimization (205--218). Framework Issues: L. Darrell Whitley, Fundamental Principles of Deception in Genetic Search (221--241); David L. Battle and Michael D. Vose, Isomorphisms of Genetic Algorithms (242--251); John J. Grefenstette, Conditions for Implicit Parallelism (252--261). Variation and Recombination: Larry J. Eshelman, The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination (265--283); B. R. Fox and M. B. McMahon, Genetic Operators for Sequencing Problems (284--300); William M. Spears and Kenneth A. De Jong, An Analysis of Multi-Point Crossover (301--315); Heinz Mühlenbein, Evolution in Time and Space-The Parallel Genetic Algorithm (316--337). The articles will not be reviewed individually.
- scientific article; zbMATH DE number 12464 (Why is no real title available?)
- scientific article; zbMATH DE number 12465 (Why is no real title available?)
- scientific article; zbMATH DE number 709406 (Why is no real title available?)
- A random-key genetic algorithm for the generalized traveling salesman problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023847)