-
chap2matlab
matlab命令大全，供初学者使用，收集了大部分有用的命令(matlab command Daquan, for beginners, collected most of the useful commands)
- 2010-06-08 09:11:59下载
- 积分：1
-
ofdm_fading
Simulation program to realize OFDM transmission system(under one path fading)
- 2010-10-31 18:13:42下载
- 积分：1
-
资源分配程序 resource allocation inofdm
本科毕业设计用到的资源分配程序，在子载波和数量上对多用户进行分配(Graduate design resource allocation procedures used to allocate subcarriers and the number of multi-user)
- 2013-03-19 16:22:07下载
- 积分：1
-
ISM
宽带DOA估计算法ISM算法经过运行正确，可以使用(ISM broadband DOA estimation algorithm after running correctly, you can use)
- 2021-04-13 14:48:56下载
- 积分：1
-
annexamples
《面向MATLAB工具箱的神经网络理论与应用》一书中实例的所有源代码，及详细说明(ANN，matlab,hop,bp,ART)
- 2009-04-23 21:28:30下载
- 积分：1
-
getPDF
helpful hints for adaptive MIMO in mat lab
- 2009-05-07 10:24:52下载
- 积分：1
-
workshop_part2
introdution of matlab part 2 and examples
- 2009-06-04 00:26:06下载
- 积分：1
-
viterbisolnEE5282Probv11
viterbi decoding and get the curve of Eb/No and bit error rate.(implement viterbi decoding using BPSK by soft decision)
- 2013-04-05 12:18:14下载
- 积分：1
-
cljs
用于计算输电网的潮流，充分考虑到线路中变压器的各种输入形式，将其归算到一种标幺值下。(Used to calculate the trend of the transmission grid, taking fully into account the the line transformer various input form, be imputed to a per-unit value.)
- 2013-04-18 14:42:53下载
- 积分：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
