Results 251 to 260 of about 473,326 (299)

Frequency assignment problems with various constraints

Proceedings of ICCS '94, 2002
Studies the problem of assigning a collection of operating frequencies to a collection of radio transmitters under various constraints including co-channel constraints, adjacent-channel constraints and co-site constraints using graph-colouring methods. Traditionally, these methods have been applied only to the co-channel constraint problem. The authors
null Ling San, null Seah Boon Huak, null Tan Eng Chye, null Tan Ser Peow   +3 more
openaire   +1 more source

Elementary landscapes of frequency assignment problems

Proceedings of the 12th annual conference on Genetic and evolutionary computation, 2010
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either directly an Elementary Landscape, or are a superposition of two Elementary Landscapes. We also examine the computability of neighborhood averages for partial neighborhoods.
L. Darrell Whitley, Francisco Chicano, Enrique Alba, Francisco Luna   +3 more
openaire   +1 more source

Solving frequency assignment problem using API algorithm

2014 International Conference on Multimedia Computing and Systems (ICMCS), 2014
The efficient frequency assignment for radio communications becomes more and more crucial when developing new information technologies and their applications. It is consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters.
Debbat Fatima, null Bendimerad Fethi Tarek   +1 more
openaire   +1 more source

Problem decomposition for minimum interference frequency assignment

2007 IEEE Congress on Evolutionary Computation, 2007
This paper applies a problem decomposition approach in order to solve hard Frequency Assignment Problem instances with standard meta-heuristics. The proposed technique aims to divide the initial problem into a number of easier subproblems, which can then be solved either independently or in sequence respecting the constraints between them.
G. Colombo, S.M. Allen
openaire   +1 more source

Frequency Insertion Strategy for Channel Assignment Problem

Wireless Networks, 2006
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls.
Shin, WY, Chang, SY, Lee, J, Jun, CH
openaire   +2 more sources

Algorithms for frequency assignment problems

CWI Quarterly, 1996
Summary: Frequency assignment problems occur when a network of radio links has to be established. Each link has to be assigned an operating frequency from a set of available frequencies. The assignment has to satisfy certain interference limiting restrictions defined on pairs of links. Moreover, the number of frequencies used is to be minimized.
Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K., Tiourine, S.R.   +3 more
openaire   +2 more sources

Metaheuristic algorithms for frequency assignment problems

2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005., 2005
Frequency assignment problems (FAPs) are among the hardest combinatorial optimization problems of great practical importance in radio communication industries. They arise in practice when an area is to be served by a number of radio transmitters, or a network of radio links is to be established. Each transmitter or link is to be assigned a frequency so
openaire   +1 more source

New hybrid genetic algorithms for the frequency assignment problem

IEEE Transactions on Broadcasting, 2002
This paper presents a new hybrid genetic algorithm used to solve a frequency assignment problem. The hybrid genetic algorithm presented in this paper uses two original mutation operators. The first mutation operator is based on a greedy algorithm and the second one on an original probabilistic tabu search.
Alabau, Miguel, Idoumghar, Lhassane, Schott, René   +2 more
openaire   +3 more sources

Algorithms for the generalized weighted frequency assignment problem

Computers & Operations Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muñoz, David F., Muñoz, Diego F.
openaire   +2 more sources

Chaotic Neurodynamics in the Frequency Assignment Problem

1998
The 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