深度优先搜索算法解决八码难题

圆孔的夫琅和费衍射，以动画的形式表式衍射的过程，以及最后衍射的图样（来源于http://luobo.ycool.com/post.701424.html）-Round hole of Fraunhofer diffraction to the form of table-style animation of the process of diffraction, and the final diffraction pattern (from http://luobo.ycool.com/post.701424.html)

著名的开源仿真软件yale，功能与matlab完全有得比-Well-known open source simulation software yale, function and matlab completely than has

subpixel motion architecture

RFID

用模拟退火算法实现的车辆配送货问题，当时的智能算法作业，自己纯手编。希望对大家有用。

implement basic routines in Matlab and Octave (currently using Matlab R13) for simulating adaptive beamforming and filtering for antenna arrays.

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.

复数运算详细算法-complex algorithm

应用背景 智能优化，线性规划，路径寻优，。。。。。。。。。。。。。。。 关键技术matlab实现，求解优化问题，最优值寻找。。。

基于C++标准模板类库的全文检索算法 -Based on C++ standard template library of full-text search algorithm