๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Channel Assignment for Cellular Networks Based on a Local Modified Hopfield Neural Network

โœ Scribed by Lydia A. Guirguis; Mona M. R. El. Ghoneimy


Publisher
Springer US
Year
2006
Tongue
English
Weight
207 KB
Volume
41
Category
Article
ISSN
0929-6212

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A compact dynamic channel assignment sch
โœ A. Dang; S. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 193 KB

## Abstract In this paper, a new channel assignment strategy named compact dynamic channel assignment (CDCA) is proposed. The CDCA differs from other strategies by consistently keeping the system in the utmost optimal state, and thus the scheme allows to determine a call succeeding or failing by lo

An expanded maximum neural network algor
โœ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB ๐Ÿ‘ 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be

A Partitioned Modified Hopfield Neural N
โœ Stuart W. Perry; Ling Guan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

## A Partitioned Modified Hopfield Neural Network Algorithm for Real-Time Image Restoration n this paper, two image partitioning schemes are examined. The first scheme examined avoids boundary conflicts by the use of four restoration phases. The second scheme examined requires a Idegr ee of synchr

On-line algorithms for the channel assig
โœ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara