搜索资源列表
Desktop
- 调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Scheduling problem backtracking algorithm is the classic problem. Problem Descr iption: Suppose there are n-task by the k-parallel machine can be complete
gzfp
- 假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。 -Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task schedu
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=
KR
- K&R best text for C, C++ programming and developing concepts for C.
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-match
- K-近似匹配，动态规划法。输入两个文本和编辑距离k，找出k以内的文本匹配情况。代码很短短，没有相当算法功底很难看懂。最好参考经典的算法设计书籍。-K-approximate matching, dynamic programming method. Two input text and edit distance k, find k within the text to match. The code is a short, not quite algorithms foundation is
TmeaanshiftCCh
- 把目标的每个颜色子空间量化为k份后，建立目标模型，在该模型型上运用meanshift进行搜索找到最佳位置。 已通过测试。 -Quantified for each target color subspace k copies after the establishment of the target model and the model type to use meanshift search to find the best location. Has been tested.
VB番薯播放器源代码
- 价格几K的番薯播放器源代码，使用当前最流行的QVOD插件播放，可以直接编译使用！如果你正在搞电影播放类的网站需要开发客户端，这是最好的参考！-Price thousands of sweet potato player source code, use the most popular QVOD widget displays can be directly compiled to use! If you need to develop a client is engaged in the mo
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
3
- 设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。 例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Set the set S consists of several words (in English), with the given strin
zi-dian
- 字典树设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。 例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Dictionary tree set S by a number of words (English), given the string
QRD_MQAM
- 使用K-BEST树型搜索算法和QR分解，检测信号(Detection of signals using the K-BEST tree search algorithm and QR decomposition)