Written in English
|Contributions||University of Glamorgan.|
Determining lower bounds for the sum of weighted constraint violations in fixed spectrum frequency assignment problems is important in order to evaluate the performance of heuristic algorithms. A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be combined with an efficient cell Author: Roberto Montemanni. Determining lower bounds for the sum of weighted constraint violations in fixed spectrum frequency assignment problems is important in order to evaluate the performance of heuristic algorithms. It is well known that, when adopting a binary. gramming, for the ﬁxed spectrum frequency assignment problem. Key words: Radio frequency assignment, ﬁxed spectrum, upper bounds, lower bounds AMS classiﬁcation: 90C27, 90C59,05C90, 90C05 1 Introduction The author’s PhD thesis studies the ﬁxed spectrum frequency assignment prob-Cited by: 6.
Lower bounds are necessary to establish the effectiveness of the heuristic algorithms used for this task and to assess the quality of the assignments obtained. In the fixed spectrum frequency assignment problem the available frequencies are known in by: Such lower bounds must be both strong and computable if they are to be used for this purpose. Bounds for the frequency assignment problem have been studied by several authors [6, 16,22], but, most of the bounds given are either weak or restricted to particular forms of constraint, which may prevent their use in a real frequency assignment by: Volume 1, Issue 3, October ISSN: (Print) Upper and lower bounds for the fixed spectrum frequency assignment problem. Roberto Montemanni Pages Upper and lower bounds for the fixed spectrum frequency assignment problem. Roberto Montemanni Pages . frequency assignment problems, namely the fixed spectrum version and the mini- mum span frequency assignment problem. We mainly study the minimum span, except in Chapter 6 where we also give results for the fixed spectrum version. In Chapter 3 we study the .
Path Relinking for the Fixed Spectrum Frequency Assignment Problem Xiangjing Lai, Jin-Kao Hao LERIA, Universit e d’Angers, 2 bd Lavoisier, Angers, Ce France Abstract The xed spectrum frequency assignment problem (FS-FAP) is a highly rele-vant application in modern wireless systems. This paper presents the rst path. We compute bounds for the domination number of some heuristics for both the fixed spectrum version of the frequency assignment problem and the minimum span frequency assignment problem. Our results show that the standard greedy algorithm does not perform well, compared to some slightly more advanced algorithms, which is what we would : Angela Erika Koller. The topic of this diploma thesis is the solving of a Frequency Assignment Prob-lem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such . A Strategy for Active Remote Sensing Amid Increased Demand for Spectrum describes the threats, both current and future, to the effective use of the electromagnetic spectrum required for active remote sensing. This report offers specific recommendations for protecting and making effective use of the spectrum required for active remote sensing.