Perturbations and phase transitions in swarm optimization algorithms
From MaRDI portal
Publication:6150990
DOI10.1007/s11047-019-09741-xzbMath1530.68289OpenAlexW2944783424MaRDI QIDQ6150990
Tomáš Vantuch, Norbert Marwan, Andrew Adamatzky, Ivan Zelinka
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-019-09741-x
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ant colony optimization for continuous domains
- Analysing spatially extended high-dimensional dynamics by recurrence plots
- Recurrence quantification based Liapunov exponents for monitoring divergence in experimental data
- Phase transitions in swarm optimization algorithms
- Measures of statistical complexity: why?
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- A review of particle swarm optimization. I: Background and development
- Ant colony optimization theory: a survey
- Self-Organizing Migrating Algorithm
- On the Complexity of Finite Sequences
- Compression of individual sequences via variable-rate coding
- Mersenne twister
- How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony
- Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
- Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks
- PHENOMENOLOGY OF RETAINED REFRACTORINESS: ON SEMI-MEMRISTIVE DISCRETE MEDIA
- Elements of Information Theory
This page was built for publication: Perturbations and phase transitions in swarm optimization algorithms
