搜索资源列表
J_Grid15
- 运用穷举法求解1-9，3*3数独问题，即使每行每列及对角线上的之和为15，算法简单，但运算时间有点长，大概是五分钟左右，请耐心等待。-Using exhaustive method to solve 1-9, 3*3 Sudoku problem, even if each row and each column and on the diagonal and 15, simple algorithm, but the operation time is long, about five min
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
dm
- 将一个四位数分成两段得到的两个两位数，它们的和的平方等于原数，具有这种性质的数没有特殊分布规律，因此采用穷举法对所有四位数进行判断，从而筛选出符合这种性质的四位数。具体算法是任取一个四位数，将其截为两部分，前两位为a，后两位为b，然后套用性质公式计算并判断。-Two two-digit number will get a four-digit divided into two sections, the square of their sum is equal to the original n
maze
- 用“穷举求解”（回溯）方法求解迷宫问题实验报告。从文件中读取迷宫数据，然后用穷举法求出一条迷宫通路，有迷宫文件的容错性检查，所有文件包括了.c源文件，.doc实验报告，.txt迷宫文件-With " exhaustive solving" (backtracking) method for solving the maze test reports. Maze of data read from the file, and then find a maze of paths w
1101
- 用穷举法解决以下问题：36块砖，36人搬，男搬4，女搬3，两个小孩抬1砖。要求一次全搬完，问男、女、小孩有多少？-Exhaustive method used to solve the following problem: 36 bricks, 36 people move, move 4 male, 3 female move, two children carrying a brick. Requires a full move those asked men, women and chil
1101
- 用穷举法解决以下问题：36块砖，36人搬，男搬4，女搬3，两个小孩抬1砖。要求一次全搬完，问男、女、小孩有多少？-Exhaustive method used to solve the following problem: 36 bricks, 36 people move, move 4 male, 3 female move, two children carrying a brick. Requires a full move those asked men, women and chil
0-1matlab
- 穷举法求解0-1整数规划的matlab程序-0-1 LP based on matlab
card_24
- 纸牌24点玩法单片机模拟器，采用穷举法 表达式计算器等，功能完善-Solitaire 24-point play microcontroller simulator, calculator and other expressions using brute-force method, functional
TSP
- 用穷举法解决TSP问题，有文档，有注释，适合新手学习-Solve TSP problem by brute-force method, there are documents, notes, suitable for beginners to learn
segment_ga
- 这是一系列图像分割的matlab程序，其中有二维最佳直方图熵法及传统遗传算法，二维最佳直方图熵法及改进遗传算法，二维最佳直方图熵法及穷举法，最佳直方图熵法及改进遗传算法，最佳直方图熵法及穷举法，并包含示例图片以及结果，是学习图像分割的一个很好的工具-This is a series of image segmentation matlab program, which has the best two-dimensional histogram entropy method and the tr
group-opt
- 利用穷举法计算检修班组与检修任务之间的优化配置组合-Calculated using the brute-force method combination of optimal allocation between maintenance team and maintenance tasks
Armstrong-number
- 阿姆斯特朗数 可采用穷举法，依次取1000以内的各数(设为i)，将i的各位数字分解后，据阿姆斯特朗数的性质进行计算和判断。-Armstrong number can be brute-force method, the number of 1000 in order to take within each (set i), i of the digits after the decomposition, according to the nature of Armstrong numbers
29
- 用穷举法找出1~100之间的质数，并显示出来,分别使用while，do……while，for循环语句实现-To find prime numbers between 1 to 100 with the brute-force method, and displayed, respectively while, do ...... while, for loop to achieve
convex
- 凸包算法，包括暴力穷举法，递归算法等，最后使用opengl将所有的凸包顶点绘制-Convex hull algorithms, including violence exhaustive method, recursive algorithm, and finally use opengl all the convex hull VertexPaint
abcd-number
- 求具有abcd=(ab+cd)2性质的四位数,具有这种性质的四位数没有分布规律，可以采用穷举法.-Demand has abcd = (ab+cd) 2 four digits of the nature of this nature, the four-digit distribution law, the brute-force method can be used.
xitong1
- 图象增强就是将原来不清楚的图像变得清晰或把我们感兴趣的某些特征强调出来，以改善图像的视觉效果或便于对图像进行其他处理。灰度图像的非线性变换是一种有效的图像增强方法，该方法对不同灰度特征的图像采用不同的非线性变换曲线进行调整。归一化非完全Beta函数可以拟合图像调整的各种非线性变换曲线，不同的参数值分别对应于不同类型的图像非线性变换曲线，但通常确定该函数参数需要采用穷举法和人工介入法，计算量大且无智能性。 量子遗传算法是量子计算和遗传算法相结合的一种新的优化算法。量子遗传算法建立在量子的态矢量
sudoku
- 使用穷举法解数独，计算时间和空格数大致呈正比-Using the exhaustive method to solve Sudoku, the calculation time and the number of spaces is roughly proportional
dijstra
- 本文件利用matlab实现dijistra算法。主要方法是标记未走完的点，然后动态优化穷举法。(This document uses MATLAB to achieve dijistra algorithm. The main method is to mark the incomplete points, and then dynamically optimize the exhaustive method.)
thethird_2
- 当不知道函数形式和样式的时候，可以用随机拟合的方法，但是效率不高。这里用遗传算法替代穷举法。其中遗传算法这个函数极好用，大家可以收藏，我这里也可以看做是这个遗传算法的应用。(When you do not know the form and style of function, you can use the random fitting method, but the efficiency is not high. Here, genetic algorithm is used instead
VB实际例子
- 实际例子,vb练习算法如何破解密码。两层循环通过穷举法把所有密码进行尝试，直到破解出密码。(In a practical example, the VB exercises algorithm how to crack the password. The two tier loop tries all the passwords by exhaustive method until the password is cracked.)