搜索资源列表
TurboC_bottles
- 分酒程序， 在此不是穷举法，只是8算出了一种，现有3 ，5 ， 8 三个空瓶，5，和里装有酒要求不借助于别的工具，分出一个的4酒来-hours liquor procedures, the law is not exhaustive, only eight of a calculated that the existing 3, 5, 8 3 bottles, 5, and Lane with the help of liquor requirements other tools, the se
0-1planning
- delphi开发的0-1规划求解代码，界面美观，使用简单，采用的是穷举法
md5破解
- DeMD5 可以破译经 MD5 算法编码过的密码，如有些共享软件或论坛程序的注册码（密码）就是使用 MD5 算法编码的。 由于 MD5 是一种不可逆的编码算法，因此要“还原”出原始密码就只能用穷举法（暴力法）了。 本程序使用了公开的 MD5 算法模块，在P4-1.5G的机器上一秒钟可以尝试约20000个号码。另外本程序还带有四个实用的密码字典，-DeMD5 be deciphered by the MD5 algorithm coding passwords, as some forum or
K－均值聚类算法C++编程
- K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, inc
子集和问题
- 子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of cour
密码字典
- 一个常用的密码生成器，可用于穷举法..........
qiongjufa
- 穷举法实现度一组数据的全排列 好东西 快-Exhaustive method to achieve the full degree of data arranged in a group of good stuff fast
vigenere
- vigenere密码在起初的破译中是靠穷举法，找出与阅读习惯最适合的明文，但是也可以先缩小穷举范围，再查找-vigenere initial crack passwords by brute-force method is to identify the most suitable and clear reading habits, but can also be reduced exhaustive range, and then find
qj
- delphi简单的穷举法演示 可用于暴力破解-delphi simple exhaustive brute force method can be used for demonstration
cang-fang
- vb做的解除 欧姆龙PLC 四位 密码保护的 源码。采用0000-FFFF穷举法，当密码正确时停止。-Omron PLC vb to do the lifting of the four password-protected source. Exhaustive method using 0000-FFFF, when the password is correct stop.
tsp10
- 穷举法解决tsp问题 但城市数目不超过11个。-Brute-force method to solve the problem but the city tsp of not more than 11.
brute-force-method
- 穷举法求解0-1整数规划的matlab程序-The brute-force method of solving 0-1 integer programming matlab program
detectInCircles
- 检测图像中最大内切圆的算法实现，基于opencv的穷举法-Test image, the largest inscribed circle algorithm, based on brute-force method of opencv
calc24
- 自个写的一个穷举法算二十四点的小程序- Oneself writes an exhaustion method calculates 24 scr ipts
24dianSourceCode
- 自己设计的24点游戏，利用穷举法，可以计算任意4个小于13的数的24点，并给出算法，而且可以让用户输入答案，判断答案的正确性。-24 points of their own design games, the use of exhaustive method can calculate any of the four is less than 13 the number of 24 points, and gives algorithms, but also allows users to in
UserKeySource
- 通过穷举法和字典法对远程数据库密码进行破解，并操纵远程数据库，如添加，删除和修改表项。-Through the exhaustive method and a dictionary method to crack the remote database passwords, and manipulate the remote database, such as add, delete and modify table entry.
six
- 穷举法计算六角星所有边的和相同.数字可以自定义,程序可以自行修改-Exhaustive method all the same side together.Exhaustive method all the same side together.
bxjdd
- 解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved.
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
Nearestpoint
- 最近点对算法的实现，用穷举法证明程序的正确性。-Nearest point of the algorithm, the exhaustive method to prove the correctness of the procedure.