Results 241 to 250 of about 473,326 (299)

Dynamic range and frequency assignment problems

, 2019
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An ANTS heuristic for the frequency assignment problem

Future Generation Computer Systems, 2000
Abstract The problem considered in this paper consists in assigning frequencies to radio links between base stations and mobile transmitters in order to minimize the global interference over a given region. This problem is NP-hard and few results have been reported on techniques for solving it to optimality.
Maniezzo V., Carbonaro A.
openaire   +3 more sources

Improving heuristics for the frequency assignment problem

European Journal of Operational Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Smith, D. H., Hurley, S., Thiel, S. U.
openaire   +4 more sources

Fireworks Algorithm for Frequency Assignment Problem

Proceedings of the 3rd International Conference on Networking, Information Systems & Security, 2020
In this paper, a new approach to resolve the problem of frequency assignment problem is proposed. (FAP) is well known in the NP-complete problems and can be modeled as an optimization problem, which the objective is to minimize the costs due to interference generated by a solution. The fireworks algorithm (FWA) is proposed for solving FAP.
El Bouti Mohamed, El Ghazi Raouan, Benameur Lamia, Alami Chentoufi Jihane   +3 more
openaire   +1 more source

Frequency Assignment Problems

1999
The term frequency assignment has been used to describe many types of problems which, quite often, have different modeling needs and objectives. These problems include: 1. Planning models for permanent spectrum allocation, licensing, and regulation which maximize utilization of all radio spectra [94]. 2.
Robert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende   +2 more
openaire   +1 more source