Results 261 to 270 of about 722,706 (299)
Some of the next articles are maybe not open access.
Frequency Channel Assignment on Planar Networks
2002For integers p ? q, a L(p, q)-labeling of a network G is an integer labeling of the nodes of G such that adjacent nodes receive integers which differ by at least p, and nodes at distance two receive labels which differ by at least q. The minimum number of labels required in such labeling is ?qp(G).
Michael Molloy 0001 +1 more
openaire +1 more source
The Breeder Genetic Algorithm for frequency assignment
1998The Frequency Assignment Problem is an NP-complete problem which occurs during the design of a cellular telecommunication network. In this paper we describe a real-world frequency assignment scenario. We designed a Breeder Genetic Algorithm (BGA) capable of dealing with up to 5500 carriers which have to be assigned frequencies.
Christine Crisan, Heinz Mühlenbein
openaire +1 more source
A Dynamic Traffic Model for Frequency Assignment
2008We are interested in improving the quality of frequency assignment via a more accurate modeling of the traffic over the network. For this purpose, we propose here an original model for FAP, which takes into account both spatial and temporal variation of the traffic.
Mabed, Hakim +3 more
openaire +2 more sources
Chaotic Neurodynamics in the Frequency Assignment Problem
1998The frequency assignment problem belongs to the quite difficult to deal with class of NP (nondeterministic polynomial) - hard combinatorial optimization problems [3]. Its computational complexity directs researchers in the field at developing efficient techniques for finding solutions realizing minimum (or maximum) values of an objective function ...
K. Dorkofikis, N. M. Stephens
openaire +1 more source
Frequency assignment for cellular radio networks
5th IEE Conference on Telecommunications, 1995Abstract Assigning frequencies to cells in a cellular radio network has traditionally been carried out either by hand or, more recently, using algorithms derived from the theory of abstract graphs. This second approach is realised by modelling the problem as a simple graph colouring problem, where vertices of the graph represent the ...
openaire +1 more source
The frequency assignment problem
2011This thesis examines a wide collection of frequency assignment problems. One of the largest topics in this thesis is that of L(2,1)-labellings of outerplanar graphs. The main result in this topic is the fact that there exists a polynomial time algorithm to determine the minimum L(2,1)-span for an outerplanar graph. This result generalises the analogous
openaire +1 more source
On frequency assignment in cellular networks
2000Sanguthevar Rajasekaran +2 more
openaire +1 more source
Multicriteria optimization for frequency assignment
2000Robert A. Murphey +2 more
openaire +1 more source
Natural frequency assignment for mass-chain systems with inerters
Mechanical Systems and Signal Processing, 2018Yinlong Hu +2 more
exaly