-
tire
picture qu zhao is very important to you(picture qu zhao)
- 2010-10-16 15:02:57下载
- 积分：1
-
simplex
改进单纯形法在matlab中的实现。通过该程序可以实现优化目标。(Improved simplex method is implemented in matlab.Through the program can realize the optimization goal.
)
- 2013-03-15 17:17:23下载
- 积分：1
-
GameTheory-master
说明： 运用博弈论，进行机器人避障避障，若多机器人之间存在动态碰撞，利用博弈论构建多机器人之间的动态避障模型，并利用虚拟行动法来解决博弈的求解问题及多Nash 均衡的选择问题，确保每
个机器人 能够快速学习到最优Nash 均衡(robot avoiding if there are dynamic collisions between multi-agents, the game theory is used to construct a dynamic obstacle avoidance model between multi-agents, and the virtual action method is used to solve the problem of solving the game and the selection of multiple Nash equilibriums to ensure that each agent can quickly learn the optimal Nash equilibrium.)
- 2019-02-14 09:58:18下载
- 积分：1
-
MFO
说明： MFO 飞蛾优化算法 matlab代码 MFO 飞蛾优化算法 matlab代码(MFO moth optimization algorithm MATLAB code MFO moth optimization algorithm MATLAB code)
- 2021-04-22 10:52:38下载
- 积分：1
-
U
说明： 基于QR分解的最小二乘算法,在工程领域有很大的应用(QR decomposition based least squares algorithm, in the engineering field has a lot of applications)
- 2008-05-16 02:18:12下载
- 积分：1
-
semi_persistent-with-priority
研究LTE系统中半静态调度引入优先级后，用户吞吐量与SNR的关系(After studying the LTE system, the introduction of the semi-static scheduling priority, and user throughput and the relationship between SNRoutput of the converted character encoding. If the input aAb, output cCg)
- 2014-08-12 10:48:08下载
- 积分：1
-
rlslms
说明： 自适应滤波的MATLAB实现，包括lms rls 等算法(MATLAB programing rls lms)
- 2009-08-08 16:23:33下载
- 积分：1
-
lp02-06mode
上次上载lp01模的计算，这次将Lp02-06一起上传，对研究光纤特别是光子晶体光纤的都有用哦(last lp01 die on the calculation that this will Lp02-06 together uploads Research on optical fiber, especially photonic crystal fibers have used oh)
- 2021-03-01 22:59:35下载
- 积分：1
-
Tonedimen
matlab temperture profile
- 2010-03-01 18:00:46下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
|
联系客服（QQ：3324461878）
