Frank Neumann – författare

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. 

It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influencesperformance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.

Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.

This book presents original peer-reviewed contributions from the London Mathematical Society (LMS) Midlands Regional Meeting and Workshop on ''Galois Covers, Grothendieck-Teichmüller Theory and Dessinsd''Enfants'', which took place at the University of Leicester, UK, from 4 to 7 June, 2018. Within the theme of the workshop, the collected articles cover a broad range of topics and explore exciting new links between algebraic geometry, representation theory, group theory, number theory and algebraic topology. The book combines research and overview articles by prominent international researchers and provides a valuable resource for researchers and students alike.  

The contributions to this volume are based on original lectures by leading researchers at the LMS-CMI Research School on ‘Homotopy Theory and Arithmetic Geometry - Motivic and Diophantine Aspects’ and the Nelder Fellow Lecturer Series, which both took place at Imperial College London in the summer of 2018. The contribution by Brazelton, based on the lectures by Wickelgren, provides an introduction to arithmetic enumerative geometry, the notes of Cisinski present motivic sheaves and new cohomological methods for intersection theory, and Schlank’s contribution gives an overview of the use of étale homotopy theory for obstructions to the existence of rational points on algebraic varieties. Finally, the article by Asok and Østvær, based in part on the Nelder Fellow lecture series by Østvær, gives a survey of the interplay between motivic homotopy theory and affine algebraic geometry, with a focus on contractible algebraic varieties.

Now a major trend in arithmetic geometry, this volume offers a detailed guide to the fascinating circle of recent applications of homotopy theory to number theory. It will be invaluable to research students entering the field, as well as postdoctoral and more established researchers.

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.

The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.

This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.