搜索资源列表
gcf
- 用改进的数据结构快速计算复杂网络的社区划分-The data structure used to improve the rapid calculation of complex network of community division
dhjghfjg
- 一组生产者向一组消费者提供消息，它们共享一个有界缓冲池，生产者向其中投放消息，消费者从中取得消息。只要缓冲池未满，生产者可将消息送入缓冲池；只要缓冲池未空，消费者可从缓冲池取走一个消息。-A group of a group of producers to provide consumers with information, they share a community pool, producers put messages to which consumers get the news.
joseph
- 编号为1,2,...,n的n个人按顺时针方向坐在圆桌边, 每人持有一密码(正整数),从第s人开始报数, 报到第m人出列, 再从下一人开始报, 直至所有的人都出列为止-Joseph Central C-list resolution process www.firnow.com Time: 2008-01-26 Author: Unknown Editor: andyyoo Views: 1557 [review] comprehensive resource bo
fzxj
- 一般解空间的队列式分支限界法 试设计一个用队列式分支限界法搜索一般解空间的函数。该函数的参数包括结点可行性 判定函数和上界函数等必要的函数，并将此函数用于解布线问题。 -Queue-type general solution space try to design a branch and bound branch and bound with a queue-type search function of the general solution space. The funct
LPA(C)
- 复杂网络的结构检测室近几年的研究热点，目前最快的算法是标签传播！-Community detection is hot topic in recent years. The most fast algorithm for community detection is Label Propagation Algorithm(LPA),and this is the program!
1229
- 和谐短信问题 对于给定的由 n 个人组成的社团以及社团员间发送短信的信息，设计一个计算最大和谐子社团的算法。 -For a given by n personal associations and community members to send SMS messages, the design of a harmonious community algorithm to calculate the maximum oscillator.