.png){kind=icon}
返回
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2002.800634.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The frequency-assignment problem is concerned with the assignment of discrete channels to the transmitters of a radio network. Separation of the frequencies assigned to transmitters is necessary to avoid interference. However, unnecessary separation causes an excess requirement for spectrum, the cost of which may be very high. The aim of the work is to minimize the frequency spectrum required for a given level of reception quality over the network. In contrast to the majority of the work presented in the literature, the model chosen to formalize the problem takes multiple interference into consideration. This should provide a better approximation of reality. The method proposed to solve this problem is an approximate nondeterministic tree search (ANTS) algorithm, which is a metaheuristic algorithm based on a computational paradigm inspired by the way real ant colonies function.
Keyword:
channel assignment
multiple interference
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Recruitment and retention of African American patients for clinical research: An exploration of response rates in an urban psychiatric hospital.招募和保留非裔美国患者进行临床研究: 城市精神病医院响应率的探索。
OAAI
OAAI分享收藏
没有更多内容
没有更多内容