On the foundations and the applications of evolutionary computing

DOI10.1007/978-3-642-32726-1_1zbMATH Open1251.68199OpenAlexW68099401MaRDI QIDQ4649201FDOQ4649201

Authors: Pierre Del Moral, Alexandru-Adrian Tantar, Emilia Tantar 

Publication date: 20 November 2012

Published in: EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32726-1_1

Recommendations

• Particle methods: an introduction with applications
• Mean field simulation for Monte Carlo integration
• Evolutionary computation methods and their applications in statistics
• scientific article; zbMATH DE number 1664968
• Particle Markov chain Monte Carlo for efficient numerical simulation

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Signal detection and filtering (aspects of stochastic processes) (60G35) Applications of branching processes (60J85)

Cites Work

• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Title not available (Why is that?)
• Sequential Monte Carlo Methods in Practice
• Sequential Monte Carlo Samplers
• Title not available (Why is that?)
• Optimization by simulated annealing
• `` Direct Search Solution of Numerical and Statistical Problems
• Title not available (Why is that?)
• A Rapidly Convergent Descent Method for Minimization
• A Simplex Method for Function Minimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Updating Quasi-Newton Matrices with Limited Storage
• Title not available (Why is that?)
• Title not available (Why is that?)
• Function minimization by conjugate gradients
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• On the stability of interacting processes with applications to filtering and genetic algorithms
• Monte Carlo strategies in scientific computing
• A sequential particle filter method for static models
• State space and hidden Markov models
• Equation of State Calculations by Fast Computing Machines
• Methods of conjugate gradients for solving linear systems
• Introduction to evolutionary computing
• Future paths for integer programming and links to artificial intelligence
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Monte Carlo Method
• A nonasymptotic theorem for unnormalized Feynman-Kac particle models
• Variable neighborhood search
• Multilevel splitting for estimating rare event probabilities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential Monte Carlo for rare event estimation
• On adaptive resampling strategies for sequential Monte Carlo methods
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Title not available (Why is that?)
• Evolutionary computation: a unified approach.
• Concentration inequalities for mean field particle models
• Simulated annealing: Practice versus theory
• Minimization by Random Search Techniques
• Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
• A taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study
• Reactive search and intelligent optimization
• Genetic genealogical models in rare event analysis
• A survey of optimization by building and using probabilistic models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• On the concentration properties of interacting particle processes
• The Monte-Carlo method for filtering with discrete-time observations
• New Ways to Calibrate Evolutionary Algorithms
• Hoeffding's inequality for uniformly ergodic Markov chains
• Title not available (Why is that?)
• Measure-valued processes and interacting particle systems. Application to nonlinear filtering problems
• A Moran particle system approximation of Feynman-Kac formulae
• Particle Motions in Absorbing Medium with Hard and Soft Obstacles
• Particle approximations of Lyapunov exponents connected to Schrödinger operators and Feynman–Kac semigroups
• Title not available (Why is that?)
• Evolutionary Computation for Modeling and Optimization
• Title not available (Why is that?)
• On the stability of nonlinear Feynman-Kac semigroups
• Asymptotic convergence of genetic algorithms
• On the Convergence of the Variable Metric Algorithm
• Genetic algorithms and very fast simulated reannealing: A comparison
• Iterative methods for solving linear equations
• Title not available (Why is that?)
• Genealogies and increasing propagation of chaos for Feynman-Kac and genetic models.
• Annealed Feynman-Kac models
• On the stability of measure valued processes with applications to filtering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evolutionary algorithms on volunteer computing platforms: The MilkyWay\@Home project

Cited In (2)

• Information processing with evolutionary algorithms. From industrial applications to academic speculations.
• Theoretical aspects of evolutionary computing. 2nd EvoNet Summer School, Middelheim campus, Univ. of Antwerp, Belgium, September 1999

This page was built for publication: On the foundations and the applications of evolutionary computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649201)