Designing data networks
Data networks
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
Learning automata: an introduction
Learning automata: an introduction
Information networks: planning and design
Information networks: planning and design
Learning Algorithms Theory and Applications
Learning Algorithms Theory and Applications
Call Admission Control in Cellular Mobile Networks: A Learning Automata Approach
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
A Learning Automata Based Dynamic Guard Channel Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
Brief paper: Asynchronous cellular learning automata
Automatica (Journal of IFAC)
An adaptive call admission algorithm for cellular networks
Computers and Electrical Engineering
Modeling a student-classroom interaction in a tutorial-like system using learning automata
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Modeling a student's behavior in a tutorial-like system using learning automata
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A note on the learning automata based algorithms for adaptive parameter selection in PSO
Applied Soft Computing
Modeling a domain in a tutorial-like system using learning automata
Acta Cybernetica
Learning automata based dynamic guard channel algorithms
Computers and Electrical Engineering
Learning automata as a basis for multi agent reinforcement learning
LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
Discretized bayesian pursuit --- a new scheme for reinforcement learning
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Modeling a teacher in a tutorial-like system using learning automata
Transactions on Computational Collective Intelligence VIII
| Hi-index | 14.99 |
The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but, in reality, different classes of packets with different packet lengths and priorities are transmitted over the networks. In this paper, we assume that the traffic consists of different classes of packets with different average packet lengths and priorities. We shall look at three different solutions to this problem. Marayuma and Tang [9] proposed a single algorithm composed of several elementary heuristic procedures. Levi and Ersoy [8] introduced a simulated annealing approach that produced substantially better results. In this paper, we introduce a new method which uses continuous learning automata to solve the problem. Our new schemes produce superior results when compared with either of the previous solutions and is, to our knowledge, currently the best known solution.