-
Chapter8
用Matlab语言实现通信系统的后处理功能(Language communication system using Matlab post-processing functions)
- 2010-06-08 11:48:26下载
- 积分:1
-
Matlab_Mfile_for_NMF
说明: 非负矩阵分解nmf,通过迭代w和h,收敛后输出最终w和h。(Non-negative matrix decomposition nmf, through iteration W and h, the final W and H are output after convergence.)
- 2019-03-07 21:58:25下载
- 积分:1
-
RGB-HSI
在matlab中实现从rgb到hsi色彩模式的转换(In matlab to achieve from the rgb color model to HSI conversion)
- 2009-01-08 10:52:11下载
- 积分:1
-
MATLAB-RUSSIAN
说明: 用MATLAB软件实现的一个经典游戏,俄罗斯方块,已经运行过了,是正确的(Using MATLAB software to achieve a classic game, the Russian box, has been run before, is correct)
- 2008-11-05 18:53:33下载
- 积分:1
-
MultiPathTV
移动通信中广泛存在的多径效应的相关程序代码。(The multipath of mobile communication)
- 2014-02-23 19:45:22下载
- 积分:1
-
matlab
《精通matlab》电子书,中文版,pdf文档形式,学习matlab的经典教材。( Proficient matlab e-books, the Chinese version, pdf file format, learning matlab classic materials.)
- 2007-11-16 01:26:41下载
- 积分:1
-
NewTextDocument
matlab program for function rotor_oscillation_HVDC_Light
- 2010-12-19 18:50:54下载
- 积分:1
-
RLS1
用Matlab实现RLS算法 画出原始信号和处理后的信号进行对比 (RLS algorithm using Matlab to draw to achieve the original signal and processed signal to compare)
- 2010-01-17 08:52:46下载
- 积分:1
-
DeMat
差分进化算法标准版,应用时可以自行修改,可以达到较好的优化效果(Differential evolution algorithm standard edition,you can change it if you want to use if for self application Can achieve better optimization effect)
- 2015-01-15 20:23:09下载
- 积分:1
-
game-theory
We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm
- 2015-03-23 14:25:30下载
- 积分:1