-
upf_demos
upf滤波算法源程序，另包含EKF、UKF，PF算法源程序(UPF source filtering algorithm, and the other contains the EKF, UKF, PF algorithm source code)
- 2008-03-28 14:00:00下载
- 积分：1
-
so_fdaf
Self-Orthogonalizing Frequency-Domain Adaptive Filter
Based on Haykin, Adaptive Filter Theory 4th ed. Section 7.2
- 2010-06-03 10:36:51下载
- 积分：1
-
MATLAB7_jichujiaocheng
matlab7.0基础教程，对于初学者很有用，pdg格式(matlab7.0 basis Guide, useful for beginners, pdg format)
- 2007-05-28 11:00:10下载
- 积分：1
-
UnconstrainedOpt
Unconstrained optimization of single variable
- 2014-11-05 00:58:20下载
- 积分：1
-
Radar-system-simulation
本程序的功能主要是雷达系统的仿真，包含雷达信号的产生，线性调频，脉冲压缩，正交双通道处理，杂波对消，MTD处理，恒虚警检测等部分内容。其中雷达信号的产生是采用7位巴克码序列。(This program ismainly about Radar System Simulation.Important part of Radar is included.)
- 2015-12-20 10:50:54下载
- 积分：1
-
SFcomplex
无标度网络生成程序。改程序可生成无标度的复杂网络，且很好展示了无标度网络的生成机理，对于初学者帮助很大。(Scale-free network generation program. Reform program will generate a complex network of scale-free, and good scale-free networks show the generation mechanism of great help for beginners.)
- 2010-11-26 20:19:29下载
- 积分：1
-
LUlusubss
Fast Sparse LU substitution
- 2010-12-16 19:43:18下载
- 积分：1
-
bpsk_Monte_Carlo
用matlab 实现bpsk的误码率蒙特卡洛仿真，可以作为编程的范例来用(Using matlab to achieve bpsk BER Monte Carlo simulation ，could be used as a programming paradigm)
- 2013-08-31 18:26:24下载
- 积分：1
-
runge4
解一阶微分方程的matlab龙格库塔法计算程序算例(Solution of first-order differential equations Runge-Kutta method matlab program examples)
- 2013-11-22 15:15:38下载
- 积分：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
