Recent advances in evolutionary computation

DOI10.1007/S11390-006-0001-4zbMath1190.68051OpenAlexW2054602817MaRDI QIDQ2508374

Yanyan Li

Publication date: 12 October 2006

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11390-006-0001-4

zbMATH Keywords

evolutionary computationreal-world applicationprisoner's dilemmacomputational time complexityneural network ensemble

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Detecting unstable periodic orbits of nonlinear mappings by a novel quantum-behaved particle swarm optimization non-Lyapunov way ⋮ EO-MTRNN: evolutionary optimization of hyperparameters for a neuro-inspired computational model of spatiotemporal learning ⋮ Improving performance of evolutionary algorithms with application to fuzzy control of truck backer-upper system

Uses Software

• SPEA2

Cites Work

• Optimization by Simulated Annealing
• Markov chains and stochastic stability
• The impact of payoff function and local interaction on the \(N\)-player iterated prisoner's dilemma
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• Ensemble learning using multi-objective evolutionary algorithms
• Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata
• Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithms.
• Evolutionary algorithms. The role of mutation and recombination
• Evolutionary computation
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Future paths for integer programming and links to artificial intelligence
• Very fast simulated re-annealing
• How to analyse evolutionary algorithms.
• A novel evolutionary algorithm for determining unified creep damage constitutive equations.
• Linear dimensionality reduction using relevance weighted LDA
• The Evolution of Cooperation
• Simulated annealing and joint manufacturing batch-sizing
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Boosting and Other Ensemble Methods
• The time complexity of maximum matching by simulated annealing
• A new simulated annealing algorithm
• Evolving Neural Network Ensembles by Minimization of Mutual Information
• Drift analysis and average time complexity of evolutionary algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recent advances in evolutionary computation