Genetic Programming Theory and Practice explores the emerging interaction between theory and practice in the cutting-edge, machine learning method of Genetic Programming (GP). The material contained in this contributed volume was developed from a workshop at the University of Michigan's Center for the Study of Complex Systems where an international group of genetic programming theorists and practitioners met to examine how GP theory informs practice and how GP practice impacts GP theory. The contributions cover the full spectrum of this relationship and are written by leading GP theorists from major universities, as well as active practitioners from leading industries and businesses. Chapters include such topics as John Koza's development of human-competitive electronic circuit designs; David Goldberg's application of "competent GA" methodology to GP; Jason Daida's discovery of a new set of factors underlying the dynamics of GP starting from applied research; and Stephen Freeland's essay on the lessons of biology for GP and the potential impact of GP on evolutionary theory.

This book constitutes the refereed proceedings of the 8th International Conference on Parallel Problem Solving from Nature, PPSN 2004, held in Birmingham, UK, in September 2004. The 119 revised full papers presented were carefully reviewed and selected from 358 submissions. The papers address all current issues in biologically inspired computing; they are organized in topical sections on theoretical and foundational issues, new algorithms, applications, multi-objective optimization, co-evolution, robotics and multi-agent systems, and learning classifier systems and data mining.

Cluster analysis means the organization of an unlabeled collection of objects or patterns into separate groups based on their similarity. The task of computerized data clustering has been approached from diverse domains of knowledge like graph theory, multivariate analysis, neural networks, fuzzy set theory, and so on. Clustering is often described as an unsupervised learning method but most of the traditional algorithms require a prior specification of the number of clusters in the data for guiding the partitioning process, thus making it not completely unsupervised. Modern data mining tools that predict future trends and behaviors for allowing businesses to make proactive and knowledge-driven decisions, demand fast and fully automatic clustering of very large datasets with minimal or no user intervention. In this volume, we formulate clustering as an optimization problem, where the best partitioning of a given dataset is achieved by minimizing/maximizing one (single-objective clustering) or more (multi-objective clustering) objective functions. Using several real world applications, we illustrate the performance of several metaheuristics, particularly the Differential Evolution algorithm when applied to both single and multi-objective clustering problems, where the number of clusters is not known beforehand and must be determined on the run. This volume comprises of 7 chapters including an introductory chapter giving the fundamental definitions and the last Chapter provides some important research challenges. Academics, scientists as well as engineers engaged in research, development and application of optimization techniques and data mining will find the comprehensive coverage of this book invaluable.

Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.

This book constitutes the refereed proceedings of the 6th European Conference on Genetic Programming, EuroGP 2003, held in Essex, UK in April 2003. The 45 revised papers presented were carefully reviewed and selected from 61 submissions. All current aspects of genetic programming and genetic algorithms are addressed, ranging from foundational, theoretical, and methodological issues to advanced applications in various fields.

The three-volume set LNAI 3213, LNAI 3214, and LNAI 3215 constitutes the refereed proceedings of the 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2004, held in Wellington, New Zealand in September 2004. The over 450 papers presented were carefully reviewed and selected from numerous submissions. The papers present a wealth of original research results from the field of intelligent information processing in the broadest sense; among the areas covered are artificial intelligence, computational intelligence, cognitive technologies, soft computing, data mining, knowledge processing, various new paradigms in biologically inspired computing, and applications in various domains like bioinformatics, finance, signal processing etc.

This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Artificial Evolution, EA 2003, held in Marseilles, France in October 2003. The 32 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision. The papers are organized in topical sections on theoretical issues, algorithmic issues, applications, implementation issues, genetic programming, coevolution and agent systems, artificial life, and cellular automata.

Incorporation of a priori knowledge, such as expert knowledge, meta-heuristics and human preferences, as well as domain knowledge acquired during evolu tionary search, into evolutionary algorithms has received increasing interest in the recent years. It has been shown from various motivations that knowl edge incorporation into evolutionary search is able to significantly improve search efficiency. However, results on knowledge incorporation in evolution ary computation have been scattered in a wide range of research areas and a systematic handling of this important topic in evolutionary computation still lacks. This edited book is a first attempt to put together the state-of-art and re cent advances on knowledge incorporation in evolutionary computation within a unified framework. Existing methods for knowledge incorporation are di vided into the following five categories according to the functionality of the incorporated knowledge in the evolutionary algorithms. 1. Knowledge incorporation in representation, population initialization, - combination and mutation. 2. Knowledge incorporation in selection and reproduction. 3. Knowledge incorporation in fitness evaluations. 4. Knowledge incorporation through life-time learning and human-computer interactions. 5. Incorporation of human preferences in multi-objective evolutionary com putation. The intended readers of this book are graduate students, researchers and practitioners in all fields of science and engineering who are interested in evolutionary computation. The book is divided into six parts. Part I contains one introductory chapter titled "A selected introduction to evolutionary computation" by Yao, which presents a concise but insightful introduction to evolutionary computation.

This book constitutes the thoroughly refereed post-proceedings of the Second International Conference on Logical Aspects of Computational Linguistics, LACL '97, held in Nancy, France in September 1997. The 10 revised full papers presented were carefully selected during two rounds of reviewing. Also included are two comprehensive invited papers. Among the topics covered are type theory, various types of grammars, linear logic, parsing, type-directed natural language processing, proof-theoretic aspects, concatenation logics, and mathematical languages.