资源列表
FastICA_2_5
- 独立成分分析(Independent Compondent Analysis，ICA)的一个非常好的示例，可以直接拿来用-Independent Component Analysis (Independent Compondent Analysis, ICA) in a very good example, can be directly used
svm-and-neast
- 这是对于近邻法与支持向量机的ppt文件，能给学习神经网络方法的初学者帮助-This is the nearest neighbor and support vector machine ppt, learning neural network can give help for beginners
bpapproachsin
- 用BP网络对三角函数进行逼近。使用三层网络，隐单元数选择为八个，故总体结构为1-8-1结构。-BP network used to approximate the trigonometric functions. Using the three networks, the number of options for the eight hidden units, so the overall structure for the 1-8-1 structure.
bpapproachrev
- 使用BP网络对反函数进行逼近。使用三层网络，隐单元数选择为20个，故总体结构为1-20-1结构。-BP network used to approximate the inverse function. Using the three networks, the number of hidden units is selected as 20, so the overall structure of 1-20-1 structure.
bp-network-sorting
- 对WORD文档里的二类数据进行分类，使用神经网络的BP算法。采用三层网络。-WORD documents in the two types of data classification, using neural network BP algorithm. Three-tier network.
VBApaike
- 设定监考工作量，随即编排监考工作，实现了两种算法-Set examiner workload, then arranged invigilation work to achieve the two algorithms
generate_skinmap
- 一种肤色检测的程序，有详细的算法和步骤，值得-A skin test procedures, detailed algorithms and procedures, it is worth a look
program
- 基于遗传算法的旅行商问题求解 旅行商问题：假设有一个推销员，要到 n 个城市推销商品，他要找出一个包含所有 n 个城市的具有最小开销的环路-Traveling Salesman Problem Based on Genetic Algorithm for Traveling Salesman Problem: Suppose a salesman, to sell goods to the n cities, he has to find a city that contains all n
0801563
- 用遗传算法解决作业车间调度问题。作业车间调度可描述为集合{J，M，Op，T}(其中:J代表工件，M代表机器，Op代表工序，T代表工件的加工时间)，即如何将工件的工序按照合理的顺序分配到机器上，以达到目标函数的要求。-Using Genetic Algorithm for Job Shop Scheduling Problems. Job shop scheduling can be described as a set {J, M, Op, T} (where: J on behalf of t
aa
- 基于遗传算法的c++编码，例子简单，适合初学者-Based on genetic algorithm c++ code example is simple, suitable for beginners to see
KnapsacksProblem
- 本程序将遗传算法应用于背包问题。借助了大自然的演化过程,是多线索而非单线索的全局优化方法,采用的是种群和随机搜索机制. -This procedure will be applied to knapsack problem genetic algorithm. With the evolution of nature, is more than a single clue leads the global optimization method, using population and ran
chengxu
- 本文中利用遗传算法求解的问题为最短路径，该问题可描述为：在某大学校园内有多个场所，各场所之间有一个相关的距离cij ，目标就是要寻找一条从指定的起点 s 到指定的终点 t 的一条路径，使总距离最小。-This paper the problem using genetic algorithm for the shortest path, the problem can be described as: a university campus in a number of places, the