Stable adaptive systems
Channel carrying: a novel handoff scheme for mobile cellular networks
IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
A new fine-grained evolutionary algorithm based on cellular learning automata
International Journal of Hybrid Intelligent Systems
Brief paper: Asynchronous cellular learning automata
Automatica (Journal of IFAC)
International Journal of Communication Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
IEEE Transactions on Evolutionary Computation
On the use of learning automata in the control of broadcast networks: a methodology
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
Journal of Parallel and Distributed Computing
Learning automata based dynamic guard channel algorithms
Computers and Electrical Engineering
Adaptive cooperative particle swarm optimizer
Applied Intelligence
Hi-index | 0.00 |
The cellular learning automaton (CLA), which is a combination of cellular automaton (CA) and learning automaton (LA), is introduced recently. This model is superior to CA because of its ability to learn and is also superior to single LA because it is a collection of LAs which can interact with each other. The basic idea of CLA is to use LA to adjust the state transition probability of stochastic CA. Recently, various types of CLA such as synchronous, asynchronous, and open CLAs have been introduced. In some applications such as cellular networks, we need to have a model of CLA for which multiple LAs reside in each cell. In this paper, we study a CLA model for which each cell has several LAs. It is shown that, for a class of rules called commutative rules, the CLA model converges to a stable and compatible configuration. Two applications of this new model such as channel assignment in cellular mobile networks and function optimization are also given. For both applications, it has been shown through computer simulations that CLA-based solutions produce better results.