搜索资源列表
2142
- 寻最小支配集,用DP,复杂度是2^8 比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
BA50
- 50个节点的BA网络模型中用穷举法求支配集-50 node network model BA exhaustive method used for dominating set
毒霸风格的界面
- 独霸风格的界面，很漂亮的-dominating style interface, a very nice
NSGA-II多目标规划代码（matlab版）
- 印度Deb教授开发的Non-dominating Sorting Genetic Algorithm的改进版本，非常适合parato封面逼近运算。
毒霸风格的界面
- 独霸风格的界面，很漂亮的-dominating style interface, a very nice
2142
- 寻最小支配集,用DP,复杂度是2^8 比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
zuixiaojixiaokongzhiji
- 利用labview求最小极小控制集,可以求得一个图的最小极小控制集-Order to minimize the use of LabVIEW minimal dominating set, you can find a map of the smallest minimal dominating set
elem_domin
- Majority - efectiv checking if in ther is some dominating element in array (more then 2 times since half of elements)-Majority- efectiv checking if in ther is some dominating element in array (more then 2 times since hal
demosaic
- 解Demosaici，使用连续逼近的方法！-Motion-compensated (MC) video coding has been dominating in the past decades. From MPEG-1/2 to MPEG-4, H.263 and the latest H.264, we have witnessed that the accumulative improvement of MC video cod
MDS
- 基于最小生成树的最小连通支配集的一种优化算法-Based on minimum spanning tree of a minimum connected dominating set algorithm
Gateway_Placement_Optimization_in_Wireless
- In a Wireless Mesh Network (WMN), the traffic is aggregated and forwarded towards the gateways. Strategically placing and connecting the gateways to the wired backbone is critical to the management and efficient
ga
- 利用禁忌遗传算法来求最小支配集，解决物联网的层簇模型的网络拓扑。 C语言编写，linux 开发环境-Using genetic algorithm to find taboo minimum dominating set, the layer of things to solve the cluster model of network topology. C language, linux development environm
white_black
- 1、问题描述 设平面上分布着n个白点和n个黑点,每个点用一对坐标(x, y)表示.一个黑点b=(xb,yb)支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw.若黑点b支配白点w,则黑点b和白点w可匹配(可形成一个匹配对).在一个黑点最多只能与一个白点匹配,一个白点最多只能与一个黑点匹配的前提下,求n个白点和n个黑点的最大匹配对数. 2、具体要求 要求:时间效率在O(NlgN) 3、实现方法
Distrrithm
- 分布式最小连通支配集启发式算法Distributed Heuristic Algorithm-Distributed Heuristic Algorithm for Minimum Connected Dominating Set
PJShop
- 数据商店，非常有用的代雄踞，可以省去你很多精力，太梆了-Data stores, very useful on behalf of the dominating, can save you a lot of energy, too bang a
Analysis-on-Channel-Capacity-of-MIMO
- 多输入多输出(MIMO)通信系统相比其他的通信系统具有更高的频谱效率，在不增加发射功率以及信号带宽的 情况下，MIMO 技术可以有效地提高系统信道容量及其性能。利用均匀角能量分布以及相关矩阵，分析了相关信道下的MIMO 系统信道容量，得出了系统信道容量的通用公式，并利用MATLAB 进行仿真。仿真结果表明，相关性的增加意味着信噪比的减 小，圆形接收天线阵列半径与角度扩展是决定MIMO 系统信道容量的主要因素。-Multipl
cds
- 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会
04840489
- A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks
i_dp2xy
- Calculate chromaticity from dominating wavelength and spectral purity.
Connected-dominating-set.ZIP
- Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks