搜索:allocation+algorithm

找到约 1,272 项符合「allocation+algorithm」的查询结果

结果 1,272
https://www.eeworm.com/dl/650/276950.html 人工智能/神经网络

基本的k-means聚类算法c++实现

基本的k-means聚类算法c++实现,对于理解算法的过程非常有帮助。 Basic implementation of k-means algorithm with c++, it is very helpful to understand the procedure of k-means algorithm.
下载 25
·
查看 1095
https://www.eeworm.com/dl/911061.html 技术资料

ViterbiDec

viterbi译码算法的matlab源代码-viterbi decoding algorithm matlab source code
下载 9
·
查看 7315
https://www.eeworm.com/dl/509222.html Matlab

LEACH算法

LEACH clustering algorithm matlab code, detailed notes for the students of great help beginners WSN protocol
下载 1
·
查看 144
https://www.eeworm.com/dl/617/425875.html 压缩解压

EZW implementation which will use wavelet transforms and do the compression decompression using EZW

EZW implementation which will use wavelet transforms and do the compression decompression using EZW coding algorithm
下载 49
·
查看 1063
https://www.eeworm.com/dl/617/425878.html 压缩解压

EZW implementation which will use wavelet transforms and do the compression decompression using EZW

EZW implementation which will use wavelet transforms and do the compression decompression using EZW coding algorithm
下载 48
·
查看 1079
https://www.eeworm.com/dl/705/471433.html 能源行业(电力石油煤炭)

This program is about economic load despatch. It has been done by using differential evolution algo

This program is about economic load despatch. It has been done by using differential evolution algorithm.
下载 175
·
查看 1110
https://www.eeworm.com/dl/523127.html 源码

bootstrap

Bootstrap algorithm used to compute significance of a statistical measure performed on the array X
下载 6
·
查看 305
https://www.eeworm.com/dl/857401.html 技术资料

MUSIC算法的matlab代码,可供仿真

MUSIC算法的matlab代码,可供仿真-MUSIC algorithm matlab code for simulation
下载 1
·
查看 2878
https://www.eeworm.com/dl/534/146226.html 其他

.数据结构 假设有M个进程N类资源

.数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2.银行家算法 设进程I提出请求Request[N],则银行家算法按如下规则进行判 ...
下载 189
·
查看 1077
https://www.eeworm.com/dl/534/146227.html 其他

数据结构 假设有M个进程N类资源

数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2.银行家算法 设进程I提出请求Request[N],则银行家算法按如下规则进行判断 ...
下载 177
·
查看 1078