野人和传教士的算法

用幂法求矩阵的特征值，求出来的是矩阵最大的特征和对应的特征向量。-method for using the power of the matrix eigenvalue, seeking the Matrix is the biggest character and the corresponding eigenvector.

对文档中的某一单词进行统计,使用C++在VC环境中开发.-right documentation of a particular word statistics, the use of the VC C development environment.

该工具箱包括了典型地贝叶斯网络学习方法，并且通过实例比较了这些方法的性能，同时还比较了这些方法用于贝叶斯分类中的准确率                                  

数值计算之牛顿插值，包含matlab代码实现！-Numerical calculation of the Newton interpolation, including the matlab code to achieve!

windows小帮手,vc6.0开发的,有点小问题-windows Assistant, vc6.0 developed a bit small problem

LC_trie 算法程序源代码-LC_trie algorithm source code

LINGO 教程 LINGO是用来求解线性和非线性优化问题的简易工具。LINGO内置了一种建立最优化模型的语言，可以简便地表达大规模问题，LINGO高效的求解器可快速求解并分析结果。-LINGO Tutorial LINGO is used to solve linear and nonlinear optimization problems of simple tools. LINGO built a model set up to optimize the language can easily express the large-scale problems, LINGO solver efficient and quick solution of the results of the analysis.

c#  实现的Kalman滤波算法能够很好地得到、观测和测量模型数据，你值得拥有。欢迎大家下载、试用。谢谢大家的支持！

旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位），每升汽油能行驶的距离为 D2，出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地，则输出“No Solution"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."

vc++神经网络模式识别，还可以，对需要做这方面的人比较有用-vc neural network pattern recognition, but also to be done in this area were more useful