搜索资源列表
PBdatawindow
- POWERBUILDER DATAWINDOW中的极品，含有甘特图、控制图、K线图等-POWERBUILDER DATAWINDOW of the best, with Gantt chart, control charts, K line graph, etc.
mima
- 试用维吉利亚密码的方法，以ART（不区分大小写）为密钥对任意给定的字母进行加密。（加密方法：将字母a,b,c…z 对应数字0,1,2……25。明文字母m，密文c，密钥k，c=m+ki mod 26 (I=1,2,3)。例如：m="data security"对应数字"3,0,19,0,18,......,19,24"；k="best" 对应数字为"1,4,18,19"密钥长度为4。c="eeltt ……r"）其中c1=m1 + k1 mod 26 = 4 (e)，c5=m5+k1 mod 26=
shizi
- 最佳高度问题。 问题描述： 假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem descr iption : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the tim
knnPcaWithGA
- In this code I have used GA in supervised PCA to find the best coeficients for overall covariance. the classification is made by K-In this code I have used GA in supervised PCA to find the best coeficients for overall covariance. the classification i
1569105014
- SIC AND K-BEST LSD RECEIVER IMPLEMENTATION FOR A MIMO-OFDM SYSTEM
K_Means_image_compression
- - K means algorithm is performed with different initial centroids in order to get the best clustering. - The total cost is calculated by summing the distance of each point to its cluster centre and then summing over all the clusters.Based on the mi
publictransport
- 仅考虑公汽线路，给出任意两公汽站点之间线路选择问题的一般数学模型与算法。并根据附录数据，利用你们的模型与算法，求出以下6对起始站→终到站之间的最佳路线。利用最优化原理，建立出一个动态规划模型，并运用广度优先的算法，在模型和算法的基础上，通过迭代的思想，实现用基于选取换乘K-1次路线的方法得到换乘K次的路线-Consider only the bus line, given a choice between any two lines for the bus station issue gener
QRD_MQAM
- 使用K-BEST树型搜索算法和QR分解，检测信号(Detection of signals using the K-BEST tree search algorithm and QR decomposition)