Foundations of Genetic Algorithms, 8th International Workshop, FOGA 2005, Aizu-Wakamatsu City, Japan, January 5-9, 2005, Revised Selected Papers

Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams.- Gray, Binary and Real Valued Encodings: Quad Search and Locality Proofs.- A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm.- NP-Completeness of Deciding Binary Genetic Encodability.- Compact Genetic Codes as a Search Strategy of Evolutionary Processes.- Asymptotic Convergence of Some Metaheuristics Used for Multiobjective Optimization.- Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems.- Tournament Selection, Iterated Coupon-Collection Problem, and Backward-Chaining Evolutionary Algorithms.- A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover.- Coarse Graining Selection and Mutation.- Perturbation Theory and the Renormalization Group in Genetic Dynamics.- Optimal Weighted Recombination.- On the Prediction of the Solution Quality in Noisy Optimization.- Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes.- Population Sizing of Dependency Detection by Fitness Difference Classification.- The Deceptive Degree of the Objective Function.