Theory of evolutionary algorithms and genetic programming

MaRDI QIDQ4460348zbMATH OpenFDO

Authors Stefan Droste, Thomas Jansen, Günter Rudolph, Hans-Paul Schwefel, Karsten Tinnefeld, Ingo Wegener

Publication date 18 May 2004

zbMATH Keywords

Randomized search heuristics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• Theoretical aspects of evolutionary algorithms
• Mathematical Foundations of Computer Science 2003
• Logic versus Approximation
• scientific article; zbMATH DE number 953056
• Analyzing evolutionary algorithms. The computer science perspective.

Cited in

(13)

• Random heuristic search: applications to GAs and functions of unitation.
• Random heuristic search
• On the analysis of a dynamic evolutionary algorithm
• Derivation of TIS for search performance quantification on HC method
• Do evolutionary algorithms indeed require random numbers? Extended study
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 1746026 (Why is no real title available?)
• Theoretical aspects of evolutionary algorithms
• Theory of evolutionary computation. Recent developments in discrete optimization
• Mathematical Foundations of Computer Science 2003
• Logic versus Approximation
• Relational Methods in Computer Science
• On benefits and drawbacks of aging strategies for randomized search heuristics

This page was built for publication: Theory of evolutionary algorithms and genetic programming

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