Dynamics of the Generalized Lotto-Type Competitive Learning

In generalised lotto-type competitive learning algorithm more than one winner exist. The winners are divided into a number of tiers (or divisions), with each tier being rewarded differently. All the losers are penalised (which can be equally or ...

Generalized Feistel Schemes (GFSs) are important components of symmetric ciphers, which have been extensively studied in the classical setting. However, detailed security evaluations of GFS in the quantum setting still remain to be explored.

In ...$\mathrm{}\mathrm{}$$\mathrm{}$$\mathrm{}$${\mathrm{}}^{\frac{\mathrm{}}{\mathrm{}}}$${}^{\mathrm{}}\mathrm{}$

This correspondence describes our attempts of incorporating particle swarm features into competitive learning. We first outline our reinterpretation of the symbols and notations used in particle swarm optimisation (PSO) algorithms. Three versions of ...