可以移动的石子合并

TI DSP TMS320F280x PWM 死区控制例程。-TI DSP TMS320F280x PWM dead-zone control routines.

路径规划 删格法

利用最小二乘法进行曲线的拟合,这是用多项式拟合曲线的源码!-using the least-squares method of curve fitting, which is the polynomial curve fitting source!

资源描述用迭代的方法求解方程的数值解，牛顿迭代法具有二阶收敛度，newton-steffensen法具有三阶收敛度。源代码注释写的很详细，只需要替换掉方程的解析式就可以计算新的方程。

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25

Cuneyt Mertayak的Adaboost-matlab程序6个文件汇总+注释，能够在MATLAB运行成功实现Adaboost算法！

1-9数字填入三个分式的a-i中，使a/bc+d/ef+g/hi=1成立-1-9 the number of fill in the three fraction of ai, so that a/bc+ d/ef+ g/hi = 1 to set up

I have developed a serial of resampling methods for particle filtering in Matlab as attached below in separate .m files that you may have interest and that you may have better implementation than me, or if you have any question, your feedback will be appreciated.  These resampling methods together with their pseudo-codes

操作系统中的磁盘调度算法-operating system disk scheduling algorithm

  输入任意的一个网，用普里姆(Prim)算法构造最小生成树。 要求建立图的存储结构（邻接表或邻接矩阵），输入任意的一个图，显示图的深度优先搜索遍历路径。 要求建立图的存储结构（邻接表或邻接矩阵），输入任意的一个图，显示图的广度优先搜索遍历路径。