Upper and lower bounds for the fixed spectrum frequency assignment problem
The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement...
Main Author: | Montemanni, Roberto |
---|---|
Published: |
University of South Wales
2001
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369079 |
Similar Items
-
Heuristic algorithms for static and dynamic frequency assignment problems
by: Alrajhi, Khaled
Published: (2016) -
Machine scheduling problems : a branch and bound approach
by: Abdul-Razaq, Tariq S.
Published: (1987) -
Theoretical advancements and applications in singular spectrum analysis
by: Silva, Agampodige Emmanuel Diyanth Sirimal
Published: (2016) -
A computational study of some methods for traffic assignment
by: Radwan, A. A. A.
Published: (1986) -
Bayesian singular spectrum analysis with state dependent models
by: Rahmani, Donya
Published: (2017)