-
7
说明： 经典无网格教程的随书算法的例程，属于第7章例程(Classical meshless algorithm tutorial routines with books belonging to Chapter 7 Routine)
- 2009-12-12 18:50:43下载
- 积分：1
-
map-world-china-america
用matlab编写的世界地图和美国地图的函数文件，用于绘制matlab环境下的世界地图和美国地图(World map and the map of the United States using matlab function files used to draw the Matlab environment map of the world and the United States map)
- 2013-02-25 16:10:10下载
- 积分：1
-
csp
CSP, Common Spatial Pattern, 共同空间模式方法用于脑电信号EEG的一种较为全面的方法。(Common Spatial Pattern(CSP) method is a way to pre-processing the brain signal (EEG) in order to decrease the influnce of noise signal.)
- 2020-06-26 19:00:01下载
- 积分：1
-
113172202elman_power_forcast
可用于光伏出力预测，引入气象影响因子，效果良好(It can be used to predict PV output, and the effect is good)
- 2021-04-13 22:18:55下载
- 积分：1
-
Desktop
it is matlab m file
- 2010-08-15 08:17:10下载
- 积分：1
-
validity
一种层次聚类的方法，用matlab实现的源代码，可对点数据等进行聚类分析(A hierarchical clustering method, using matlab to achieve the source code, can be carried to the point of data clustering analysis)
- 2013-11-03 20:49:00下载
- 积分：1
-
css
calculation of number of poles using mat lab
- 2009-10-29 23:43:17下载
- 积分：1
-
questioninMATLAB
精通MATLAB必备题库，pdf版书籍，希望有用(question of
matlab)
- 2010-06-02 23:55:54下载
- 积分：1
-
Csharp_matlab-
Csharp调用matlab函数的例子，实现Matlab中的函数，在Csharp中方便的调用。(Csharp call matlab function examples, to achieve a function in Matlab, conveniently call in Csharp.)
- 2011-11-14 17:22:07下载
- 积分：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
