default search action
Evolutionary Algorithms and Chaotic Systems 2010
- Ivan Zelinka, Sergej Celikovský, Hendrik Richter, Guanrong Chen:
Evolutionary Algorithms and Chaotic Systems. Studies in Computational Intelligence 267, Springer 2010, ISBN 978-3-642-10706-1
Theory
- Ivan Zelinka, Guanrong Chen:
Motivation for Application of Evolutionary Computation to Chaotic Systems. 3-36 - Ivan Zelinka, Hendrik Richter:
Evolutionary Algorithms for Chaos Researchers. 37-88 - Sergej Celikovský, Ivan Zelinka:
Chaos Theory for Evolutionary Algorithms Researchers. 89-143 - Donald Davendra:
Evolutionary Algorithms and the Edge of Chaos. 145-161
Applications
- Roman Senkerik, Ivan Zelinka, Donald Davendra, Zuzana Oplatková:
Evolutionary Design of Chaos Control in 1D. 165-190 - Ivan Zelinka:
Evolutionary Control of CML Systems. 191-235 - Mohammed Chadli:
Chaotic Systems Reconstruction. 237-264 - Ivan Zelinka, Ales Raidl:
Evolutionary Reconstruction of Chaotic Systems. 265-291 - Ping Li, Zhong Li, Wolfgang A. Halang, Guanrong Chen:
Cryptography Based on Spatiotemporal Chaotic Systems. 293-328 - Ivan Zelinka, Roman Jasek:
Evolutionary Decryption of Chaotically Encrypted Information. 329-343 - Ivan Zelinka, Guanrong Chen, Sergej Celikovský:
Chaos Synthesis by Evolutionary Algorithms. 345-382 - Ivan Zelinka, Ales Raidl:
Evolutionary Synchronization of Chaotic Systems. 383-407 - Hendrik Richter:
Evolutionary Optimization and Dynamic Fitness Landscapes. 409-446 - Donald Davendra, Ivan Zelinka:
Controller Parameters Optimization on a Representative Set of Systems Using Deterministic-Chaotic-Mutation Evolutionary Algorithms. 447-480 - Donald Davendra, Ivan Zelinka, Godfrey C. Onwubolu:
Chaotic Attributes and Permutative Optimization. 481-517 - Ivan Zelinka, Sergej Celikovský:
Frontiers. 519-521
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.