搜索资源列表
MayVote10
- 功能： 1.使用JS调用 2.方便的后台管理，可自由添加/删除 管理员 3.可以自定义投票项目为 单/多 选 4.可以自定义投票 选项的排列顺序 5.每个投票项目下的选项不做任何数量限制，支持无限 6.每个投票项目使用独立的防刷新限制，可以自由设置投票间隔时间 7.支持数据库 备份/恢复/压缩 后台登陆：MayVoteAdmin/Admin_Login.asp 管理员ID：admin 密码：admin-functions : 1. Calling the
ISP(Independent)
- 该程序是关于模拟退火应用中ISP(独立集问题)-the procedure on simulated annealing applications ISP (independent set)
EmEstimate
- 给定独立同分布样本集，用matlab编程实现EM算法进行参数估计-Given the independent and identically distributed sample set, using matlab programming EM algorithm to estimate parameters
1
- 超级模块3.65源码 最新版已支持多超级列表框独立设置交替色、指定单元格色或指定行、列色-Super Module 3.65 Source Latest version supports multi-super-independent set alternate color list box, specify the color or specify a cell row, column color
ISCLIQUE
- 计算independent set和clique-compute maximal independent set and clique
INDEPENDENT-SET-SOURCE-CODE.tar
- Maximal Independent set
losslessimagezipalgorithm
- 图像无损压缩算法代码全集,适合做图像无损压缩研究的入门人员收藏研究.-AR002 Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is compressed with static Huffman. The file is chopped into pieces which all get their own independe
Desktop
- 图最大团的算法和独立集最大团算法的论文，指导意义明显，详细解释了最大团的算法。-Figure largest group of independent set algorithms and maximum clique algorithm paper, clear guidance, a detailed explanation of the largest groups of algorithms.
approxIndep
- 求独立集的近似算法，使用C++描述，供算法设计学习者参考-For independent set approximation algorithm, using C descr iption
umutex
- ICU Mutex wrappers. Wrap operating system mutexes, giving the rest of ICU a platform independent set of mutex operations. For internal ICU use only.
GCP
- 着色问题，是最著名的NP-完全问题之一。 给定一个无向图G＝（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the se
MFCNetwork-chat-tool
- 基于VC6.0环境编辑的网络聊天室源码程序，具有服务器与客户端两份文件，通过自主设定服务器，然后在运行两客户端登入服务器IP地址，可进行相互对话-Network chat room source code based on VC6.0 environment editor program, with the server and client two documents, through independent set server, then running two client login
GA
- An implementation of Genetic Algorithm using java. This specifically for Independent set in graph. But you can use it for your own usage by changing fitnessCalc class.-An implementation of Genetic Algorithm using java. This is specifically for Indepe
LUBYs-Alghoritm
- Luby s Alghoritm to find maximum Independent Set
main
- 对独立按键功能进行设置，前面3个按钮 按下LED灯亮 松开LED灭，同时加上延时效果。-Key features of the independent set, in front of three LED lights release button is pressed LED off, while adding delay effect.
MWCP(TS)
- 采用禁忌搜索算法解决最大权值团问题，包含最大独立集于最大权值团之间的转换问题。-Tabu search algorithm using the maximum weight clique problem solving, contains the largest independent set in the maximum weight conversion problems between the groups.
Chordality
- calculate minimum independent set and maximum clique number of a chordal graph
GREEDY MAX-IS
- 最大独立集的贪心算法简易实现，可以快速求取节点数量较少的最大独立集问题。(An approximated greedy algorithm for Maximum Independent Set Problem)
201421356_???
- maximum weight independent set
ISP
- 独立集是指图 G 中两两互不相邻的顶点构成的集合。任意有关图中团的性质都能很自然的转述成独立集的性质。一般而言，寻找图的最大团是 NP 困难的，从而寻找图的最大独立集也是 NP 困难的。用模拟退火算法找出图的最大独立集。(Independent set is a set of vertices in graph G that are not adjacent to each other. The properties of cliques in any graph can be naturall