-
audio_denoising
主要用于对语音信号进行阈值消噪处理,包括软硬阈值消噪(audio signal threshold denoising )
- 2009-04-29 09:26:00下载
- 积分:1
-
3
说明: 是关于通信仿真的几个程序,里面有调幅、调频等的仿真程序代码!(Communications simulation on several procedures, which has AM, FM, such as the simulation program code!)
- 2008-07-08 15:36:17下载
- 积分:1
-
Introduction
a source code to do the compression with low a and low mu
- 2012-02-01 03:32:23下载
- 积分:1
-
Power-spectrum-estimation
从介绍功率谱的估计原理入手分析了经典谱估计和现代谱估计两类估计方法的原理、各自特点厦在Maflab中的实现
方法。(Start from the introduced power spectrum estimation principle analysis of the classical spectrum estimation principle of two types of estimation methods and modern spectral estimation, the respective characteristics of buildings in Maflab implementation method.)
- 2012-11-27 11:22:11下载
- 积分:1
-
GridResMan
RESOURCES MANAGEMENT IN GRID COMPUTING
- 2010-11-25 04:20:29下载
- 积分:1
-
RK4method
approximate solutions of 4th order ODE using the Runge–Kutta method (RK4)
- 2011-05-18 22:52:44下载
- 积分:1
-
capture-daq
convolution code, changes over time, pulse pwm, capture sound port compared matlab matlab own
- 2013-08-03 02:28:26下载
- 积分:1
-
pfm_gongjing
matlab编程的关于共晶凝固的相场法模拟程序。(matlab programming on eutectic solidification phase field simulation program.)
- 2020-08-15 15:58:29下载
- 积分:1
-
UWB_Channel_IEEE
IEEE standard channel estimation
- 2011-12-12 13:03:10下载
- 积分: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