搜索资源列表
PSO(matlab)
- 在matlab7.0下沒問題，有性趣的人可以拿回去參考參考。-Matlab7.0 no problem in the next, there are interested people can go back and refer to the reference holding.
GA
- 遺傳演算法(Genetic Algorithm),使用c++編譯，有需要者拿回去參考吧！-Genetic algorithm (Genetic Algorithm), using c++ compiler, there is a need to go back and refer to those who get it!
GA(java)
- 遺傳演算法(Genetic Algorithm),使用java編譯，有需要者拿回去參考吧！-Genetic algorithm (Genetic Algorithm), using the java compiler, there is a need to go back and refer to those who get it!
OTHERS
- 包含一些大眾化的數學題目，比如說buffon丟針問題、dijkstra的三色旗問題、找零錢問題、背包問題、無限位數的整數運算、最短路徑問題-Contains a number of popular topics in mathematics, for example, lost buffon needle problem, dijkstra the tri-color flag in trouble, go to change the problem, knapsack problem, inf
hymxszmnrmzn
- 黑油模型数值模拟入门指南 市场上有不少关于油藏数值模拟的书，但好像没有类似围棋入门指南那样从基础开始一步 一步介绍的书。我收到不下二十个问油藏数值模拟如何入门的问题。我尝试写一写油藏数值模拟 入门指南，希望对那些刚刚开始进入油藏数值模拟领域的工作者有所帮助-Numerical simulation of black oil model Start Guide on the market, many of reservoir simulation, but it seems there
gabp
- ga优化神经网权值&阈值程序。 优化的基本原理和过程很多论文可以查到，在此不必赘述我就把用gaot5的小程序贴在下面吧，也是y=1/x-ga optimization neural network weights & threshold procedures. Optimization of the basic principles and processes can be found in many papers, do not have to go into details he
jiaoben
- 一个完整的脚本演示，包含源码，以及演示包，想学的去看看吧-Demonstration of a complete scr ipt, including source code, as well as the presentation package, I would like to go and see to learn
FFT
- for fast fourier transform inprtant program kindly go through it hope you wil be benifitted by the program uploded here
lvbosuanfa
- 常有的滤波算法，有需要的可以去-Common filtering algorithm, there is need to go take a look!
bubble
- 程序实现冒泡算法，效率较高。程序是从两边往中间走的，直到中间子表为空为止。本程序比C语言上的效率高很多。-Program to achieve bubble algorithm is efficient. Program is from the middle of both sides to go until the middle of the child table is empty. This procedure than the C language in efficiency is mu
BuildAndOutputDiagramForC
- 用C语言实现数据结构中的图的建立和输出，可实现输出有向图和无向图，由用户自己选择建立有向图还是无向图的邻接矩阵。用户输入图的定点和边的信息，存储到相应的存储结构中去，而后输出图的邻接矩阵。-Data structure using C language implementation of the map creation and output, enabling the output have to map and undirected graph, chosen by the user to
ADDC
- ADDc算法，模式识别算法，这是一个函数，打击可以去研究一下啊-ADDc algorithm, pattern recognition algorithm, which is a function, combat can go to look at ah
postfixexpression
- 运用栈的基本运算。（进栈、出栈） 依次扫描表达式的操作数并入栈，遇到运算符时，将后进的两个操作数出栈，对其进行运算，将运算结果入栈。照此方法，进行下去，一直到执行完最后一个运算符，输出结果。-The use of basic computing stack. (Into the stack, out of the stack) followed by scanning the expression operands and stack encountered operator, it wil
101
- 常胜将军 :在计算机后走的情况下，要想使计算机成为“常胜将军”，必须找出取 关键。根据本题的要求枷以总结出，后走一方取子的数量与对方刚才一步取子的数量之和等于，就可以保证最后一个子是留给先取子的那个人的。-Ever Victorious General: On the computer where to go, in order to make the computer become " Ever Victorious generals" must be taken to fi
final
- 应用相位差法通过2次插值的算法设计，用于信号处理中对运算量要去不高的场合-Application of phase law was passed two times interpolation algorithm design for signal processing of the computation is not high occasions to go
shuta1
- 算法分析经典的数塔问题，从顶部出发，在每一结点可以选择向左走或是向右走，一起走到底层，要求找出一条路径，使路径上的值最大。 -Algorithm analyzes a number of classic tower problem, starting from the top, at each node can choose to go left or right, go, walk out together to the ground floor, asked to find a pat
8-puzzle-genetic
- It s simple implementation of Genetic Algorithm on 8-puzzle and as result it can say either there is or not a set of movement to go from initial state to a given final state.-It s simple implementation of Genetic Algorithm on 8-puzzle and as re
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
lvxingshang_monituihuo
- 一个旅行商要去N个城市旅行，这N个城市中，任意两个城市之间都有一条路径，路径的长度按照两个城市之间的直线距离计算。找出一条路径，使得旅行商从A城市出发经过所有的城市再回到A城市，所经过的路径最短，每个城市不能重复旅行。-A traveling salesman to go to N cities, travel, the N cities, any two cities have a path, the path length of the straight line between the t
josephus
- 问题描述： 新Josephus排列问题定义如下：假设n个人排成一个环形，给定一个正整数m，从第1 个人开始，沿环计数，每遇到第m个人就让其出列，这时计算器m自动加一，且计数继续进 行下去。这个过程一直进行到所有的人都出列为止，最后出列者为赢家。设这n个人的编号 分别为1～n，每次从编号为1的竞赛者开始计数，那么每个人出列的次序定义为整数1～n 的一个排列。这个排列称为一个(n,m)Josephus排列。 例如，(7,3)Josephus 排列为3，7，6，2，4，1，5。