Location:
Search - dominating
Search list
Description: 寻最小支配集,用DP,复杂度是2^8
比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
Platform: |
Size: 1403 |
Author: ziliang |
Hits:
Description: 50个节点的BA网络模型中用穷举法求支配集-50 node network model BA exhaustive method used for dominating set
Platform: |
Size: 38843 |
Author: 朱春晖 |
Hits:
Description: 独霸风格的界面，很漂亮的-dominating style interface, a very nice
Platform: |
Size: 69039 |
Author: 于兰 |
Hits:
Description: 印度Deb教授开发的Non-dominating Sorting Genetic Algorithm的改进版本，非常适合parato封面逼近运算。
Platform: |
Size: 178589 |
Author: efdc_wasp@126.com |
Hits:
Description: 独霸风格的界面，很漂亮的-dominating style interface, a very nice
Platform: |
Size: 68608 |
Author: 于兰 |
Hits:
Description: 寻最小支配集,用DP,复杂度是2^8
比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
Platform: |
Size: 1024 |
Author: ziliang |
Hits:
Description: 利用labview求最小极小控制集,可以求得一个图的最小极小控制集-Order to minimize the use of LabVIEW minimal dominating set, you can find a map of the smallest minimal dominating set
Platform: |
Size: 20480 |
Author: victor8064 |
Hits:
Description: 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 half of elements)
Platform: |
Size: 3072 |
Author: dudek |
Hits:
Description: Stanley B.Lippman所著的<<C++ Primer>>雄踞书坛经久不衰，堪称C++最佳校本,但是走过10个年头后，Lippman又返璞归真地写了这276页的<<Essential C++>>!-Written by Stanley B. Lippman < <C++ Primer> > Dominating the scene enduring book, is a C++ the best school-based, but after the past 10 years, Lippman also wrote Return to Innocence 276 of the < <Essential C++> > !
Platform: |
Size: 8244224 |
Author: 成龙 |
Hits:
Description: 解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 coding. However, what lacks in the standardization-propelled research is to maintain a healthy skeptism toward the role of MC in video coding. In this project, we attempt to challenge the current video coding paradigm by proposing a sound alternative that does not involve any explicit motion estimation or compensation. Instead, motivated by the duality between edge profile of 2D images and motion trajectory of 3D video
Platform: |
Size: 34816 |
Author: panhanming |
Hits:
Description: 图论的算法书籍，书中包含许多经典的例子，入门用。
章节：1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性-Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the
Platform: |
Size: 4300800 |
Author: wlx |
Hits:
Description: 基于最小生成树的最小连通支配集的一种优化算法-Based on minimum spanning tree of a minimum connected dominating set algorithm
Platform: |
Size: 1024 |
Author: 唐三 |
Hits:
Description: 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 operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios. -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 operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios.
Platform: |
Size: 240640 |
Author: Dinh Huu Nghia |
Hits:
Description: 利用禁忌遗传算法来求最小支配集，解决物联网的层簇模型的网络拓扑。
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 environment
Platform: |
Size: 6983680 |
Author: 成伟 |
Hits:
Description: 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、实现方法
基于贪心算法
以x坐标的升序对黑点排序(可用QUICKSORT或者HEAPSORT),对白点生成一个小根堆!-1 Description of the problem based on the distribution of plane n-n-white spots and black spots, each point with a pair of coordinates (x, y) said. A black point b = (xb, yb) dominating a white point w = ( xw, yw) if and only if xb> = xw and yb> = yw. If the black point b dominant white w, then the black point and white point w b can match (which can form a matched pair). in a black spot at most can only be matched with a white spot, a white point can only match with the premise of a black point, find the n-n-white spots and black spots on the maximum number of matches. 2, specific requirements requirements: time efficiency in the O ( NlgN) 3, Implementation of the greedy algorithm based on x coordinates in ascending order of black spots (available QUICKSORT or HEAPSORT), generating a small white spot root heap!
Platform: |
Size: 375808 |
Author: zaclina |
Hits:
Description: 分布式最小连通支配集启发式算法Distributed Heuristic Algorithm-Distributed Heuristic Algorithm for Minimum Connected Dominating Set
Platform: |
Size: 969728 |
Author: |
Hits:
Description: 数据商店，非常有用的代雄踞，可以省去你很多精力，太梆了-Data stores, very useful on behalf of the dominating, can save you a lot of energy, too bang a
Platform: |
Size: 619520 |
Author: zhangying |
Hits:
Description: 多输入多输出(MIMO)通信系统相比其他的通信系统具有更高的频谱效率，在不增加发射功率以及信号带宽的
情况下，MIMO 技术可以有效地提高系统信道容量及其性能。利用均匀角能量分布以及相关矩阵，分析了相关信道下的MIMO
系统信道容量，得出了系统信道容量的通用公式，并利用MATLAB 进行仿真。仿真结果表明，相关性的增加意味着信噪比的减
小，圆形接收天线阵列半径与角度扩展是决定MIMO 系统信道容量的主要因素。-Multiple-input multiple output (MIMO) communication architecture, as compared with conventional
techniques, has even higher spectral efficiency, and MIMO technique could greatly improve channel capacity and
performance of the system without any increase of transmitting power and bandwidth. By uniform angular distribution
and the correlation matrix, the MIMO channel capacity in correlated channel is investigated. Numerical simulation
is performed with MATLAB, thus to verify the proposed formula. Simulation result indicates that, for this model,
the increase of correlation means the reduction of signal-to-noise ratio (SNR), and the circular receive antenna
array radius or angle spread is the dominating factor for channel capacity.
Platform: |
Size: 805888 |
Author: 蜡笔 |
Hits:
Description: 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。-Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected.
Platform: |
Size: 3449856 |
Author: |
Hits:
Description: Distributed Construction of Connected Dominating
Set in Wireless Ad Hoc Networks
Platform: |
Size: 151552 |
Author: soap |
Hits: