这是操作系统的一个课程设计，是关于生产者－消费者的一个模拟算法。...

数值计算方法 列主元素法-numerical method main-element method

The code is based on Otsu threshold algorithm and heritage road split code to calculate the optimal threshold, enabling the road segmentation, experimental results are good.The code is based on Otsu threshold algorithm and heritage road split code to calculate the optimal threshold, enabling the road segmentation, experimental results are good.

A*寻路算法, 源代码中使用的SDL库，可以到http://www.libsdl.org/或者VC知识库网站工具栏目www.vckbase.com/tools下载。-A* Routing algorithms, source code used in the SDL libraries, or can http://www.libsdl.org/ VC Knowledge Base site columns www.vckbase.com tools/tools download.

poason method to make mesh

应用背景人脸识别准确率97.18%，1秒完成。可能是复杂的，在光的工作环境是真实的，并支持更多的人的脸在一个场景中的检测，识别关键技术# Matlab C，C + +试着usb_device_id.txt USB设备文件ID号，而不是1或2，所以给它一个尝试。1。人脸识别模式1C1速度：320×240，P4 2.4GHz CPU：图像尺寸小于1秒，（总数无关的图书馆）。2。人脸识别模式1cn速度

曲线拟合，实现啦格朗日曲线画法，可以实时产生随机数来画-Curve fitting, curve realize you granges painting, you can generate random numbers in real-time to painting

模拟退火算法 C++ 实现 -simulated annealing algorithm to achieve C

33届acm亚洲区域赛成都赛区1001题源码-33rd acm Chengdu Asian Regional Conference tournament title of 1001 source

一个介绍最优化方法课件，很详细。从最简单的一维搜索到共轭梯度，最速下降法等等，都有说明-An optimization method introduction courseware, in great detail. From the simplest one-dimensional search to the conjugate gradient, steepest descent method, etc., all indicate

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.