线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解...

资源描述大家互相学习，共同进步！fpga也是比较好的！

用Kruskal算法构造最小生成树解决指派问题（assignment problem） 一家公司经理准备安排 名员工去完成 项任务，每人一项。由于各员工的特点不同，不同的员工去完成同一项任务时所获得的回报是不同的。如何分配工作方案可以使总回报最大？ -Kruskal Algorithm used to solve assignment problem minimum spanning tree (assignment problem), a manager of the company prepare arrangements for employees to complete tasks, each one. As a result of the characteristics of different staff, different staff to accomplish the same mission when the return is different. How to allocate the work program can make the greatest total return?

资源描述该课题旨在将动态优化问题（目标函数随时间连续、缓慢或突然、随机变化的情况）连续变化的时间变量区间进行任意划分，在得到的每个时间子区间上将动态问题转化为静态问题，针对此静态优化问题设计相应的遗传算法。同时给出一种能自动检测时间变化的应答算子。

计算机图形学，Douglas曲线拟合，Delphi源码，值得学习。-Computer Graphics, Douglas curve fitting, Delphi source code, it is worth learning.

这是关于Dai so tuyen tinh的资料，请参阅附件。这是关于Dai so tuyen tinh的资料，请参阅附件文件。这个是否向供应商提供有关Dai so tuyen tinh的信息，请参阅随附文件

这个是谐波处理的插值算法 具体的内容程序里面有描述，主要思想就是插值，修正，然后恢复，使得没有因为同步处理的信号更好展示

本程序由kyungsang基姆制作。如果你有问题或问题，发送电子邮件到me.kssigari@gmail.complease试试这些测试步骤1。模拟器是用于测量投影。2。demo2是解析重建众所周知过滤backprojection3。Demo3 is the iterative reconstruction using the maximum likelihood expectation maximization (MLEM) method.nx: number of image pixels of x-directionny: number of image pixels of y-directionnz: number of image pixels of z-directionsx: real size (length) of x-axis of the image -> resolution of a pixel = sx/nxsx: real size (length) of y-axis of the image -> resolution of a pixel = sy/nysx: real size (length) of z-axis of the image -> resolution of a pixel = sz/nznu: number of detector pixels of x-direction (u)nv: number of detector pixels of z-direction (axial) (v)su: size of real (length) of detector u-direction -> resolution of a pixel = su/nusv: size of real (length) of detector v-direction -> resolution of a pixel = sv/nvDSD: distance between source to detectorDSO: distance between source to iso-center (image center).dir: rota

-$A8 -$B- -$C+ -$D+ -$E- -$F- -$G+ -$H+ -$I+ -$J- -$K- -$L+ -$M- -$N+ -$O+ -$P+ -$Q- -$R- -$S-

禁忌搜索算法的例子程序求解Tsp问题- The taboo search algorithm example procedure solves the Tsp question

3n+1的算法 acm程序设计大赛的练习题目-3n algorithm acm a program design contest entitled to practice