Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

Details Solving the Frequency Assignment Problem by Site Availability and Constraint Programming Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

2010-01-07

arxiv.org/abs/1001.1093v1

Mathematics

Optimization and Control

11 pages, 1 figure and 3 tables

Scientific paper

The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.

Affiliated with

Also associated with

No associations

Rating

Solving the Frequency Assignment Problem by Site Availability and Constraint Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the Frequency Assignment Problem by Site Availability and Constraint Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the Frequency Assignment Problem by Site Availability and Constraint Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373778