Listing 1 - 6 of 6 |
Sort by
|
Choose an application
Choose an application
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 influences performance. 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.
Computers. --- Artificial intelligence. --- Mathematical optimization. --- Operations research. --- Decision making. --- Theory of Computation. --- Artificial Intelligence. --- Optimization. --- Operations Research/Decision Theory. --- Evolutionary computation. --- Computation, Evolutionary --- Neural networks (Computer science) --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Fifth generation computers --- Neural computers --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Decision making --- Computer science. --- Operations Research and Decision Theory. --- Informatics --- Science
Choose an application
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 influences performance. 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.
Numerical methods of optimisation --- Operational research. Game theory --- Mathematical statistics --- Planning (firm) --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- besluitvorming --- computers --- mathematische modellen --- econometrie --- wiskunde --- KI (kunstmatige intelligentie) --- operationeel onderzoek --- AI (artificiële intelligentie)
Choose an application
Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo
Choose an application
Numerical methods of optimisation --- Operational research. Game theory --- Mathematical statistics --- Planning (firm) --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- besluitvorming --- computers --- mathematische modellen --- econometrie --- wiskunde --- KI (kunstmatige intelligentie) --- operationeel onderzoek
Choose an application
With a focus on the interplay between mathematics and applications of imaging, the first part covers topics from optimization, inverse problems and shape spaces to computer vision and computational anatomy. The second part is geared towards geometric control and related topics, including Riemannian geometry, celestial mechanics and quantum control. Contents:Part ISecond-order decomposition model for image processing: numerical experimentationOptimizing spatial and tonal data for PDE-based inpaintingImage registration using phase・amplitude separationRotation invariance in exemplar-based image inpaintingConvective regularization for optical flowA variational method for quantitative photoacoustic tomography with piecewise constant coefficientsOn optical flow models for variational motion estimationBilevel approaches for learning of variational imaging modelsPart IINon-degenerate forms of the generalized Euler・Lagrange condition for state-constrained optimal control problemsThe Purcell three-link swimmer: some geometric and numerical aspects related to periodic optimal controlsControllability of Keplerian motion with low-thrust control systemsHigher variational equation techniques for the integrability of homogeneous potentialsIntroduction to KAM theory with a view to celestial mechanicsInvariants of contact sub-pseudo-Riemannian structures and Einstein・Weyl geometryTime-optimal control for a perturbed Brockett integratorTwist maps and Arnold diffusion for diffeomorphismsA Hamiltonian approach to sufficiency in optimal control with minimal regularity conditions: Part IIndex
Image processing --- Image analysis --- Analysis of images --- Image interpretation --- Photographs --- Forensic sciences --- Imaging systems --- Pictorial data processing --- Picture processing --- Processing, Image --- Optical data processing --- Mathematical models. --- Inspection
Listing 1 - 6 of 6 |
Sort by
|