开放式频谱接入的并行分组分配算法 关键词：认知无线电；开放式频谱分配；图论着色；并行算法 [gap=723]Key words: Cognitive radio; Open spectrum allocation; Graph-coloring; Parallel algorithm
基于6个网页-相关网页
Graph Coloring Problem 色问题 ; 图着色问题 ; 路线着色问题 ; 图表着色问题
interval-graph coloring 区间图着色
graph-coloring algorithm 图形着色演算法
Color Sensitive Graph Coloring 颜色敏感的图论着色 ; 敏感的图论着色
parallel graph-coloring 并行图着色
graph-coloring global register allocation 色全域暂存器配置
Robust Graph Coloring Problem-RGCP 色问题
graph coloring [数] 图着色 ; 图色
A novel method for graph coloring problem (GCP) is presented.
4.研究了一种求解图着色问题的新解法。
参考来源 - 自然启发的优化算法及其应用研究The graph coloring problem (GCP) is a widely studied combinatorial optimization problem.
图的着色问题是一个被广泛研究的组合优化问题。
参考来源 - 遗传算法在图着色问题中的应用Graph colorings belong to classical graph theoretical problems. Graph coloring theory is very important in discrete mathematics, and has plenty of theoretical results and extensively practical applications.
图的染色是经典的图论问题,图的染色理论在离散数学中占有很重要的地位,并且有着丰富的理论结果和广泛的实际应用。
参考来源 - 图的限制染色及其相关问题的研究Equitable total coloring is one of the hardest problems in graph coloring.
图的等全着色是图的着色问题中的难题之一。
参考来源 - 若干图的等全着色及彩虹支配问题的研究What’s more, we introduce the allocation models based on the game theory, the graph coloring theory and the competitive auction theory, and there is comparison between them.
并且介绍了基于博弈论、拍卖竞价理论和图着色理论等经济学和数学理论模型现有的典型的频谱分配算法,并进行对比和分析。
参考来源 - 认知无线电中基于频谱空洞时变性的频谱分配Two radio resource sharing algorithms for wireless networks,C_TDRS and S_TDGRS,were proposed based on graph coloring.
基于图染色理论提出了2种无线网络中的无线资源共享算法C_TDRS和S_TDGRS。
参考来源 - 无线网络中兼顾业务类型及公平性的无线资源共享问题研究·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
The concept of square-free coloring was introduced in graph theory by Alon in 2002.
无正方形着色的概念由阿龙在2002年引入图论。
Taking an issue in graph coloring as a teaching subject, the paper puts forward a feasible concept in the design of HVE mathematical modeling teaching.
该文通过一个图形着色问题作为教学主题，提出一种比较容易实现的高职数学建模的教学设计理念。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
应用推荐