搜索资源列表
Huffman程序
- 为得到使电文总长最短的二进制前缀编码，则以n种字符出现的频率作权，设计一棵Huffman树，求出给定权值的字符对应的Huffman编码。-enable the message to be chief of the shortest prefix binary coding, while the n characters of frequencies for the right to design a Huffman tree, obtained the right to set the valu
MCRGSA
- MCRGSA------组播路由问题遗传模拟退火算法 ％M-----------遗传算法进化代数 ％N-----------种群规模，取偶数 ％Pm----------变异概率调节参数 ％K-----------同一温度下状态跳转次数 ％t0----------初始温度 ％alpha-------降温系数 ％beta--------浓度均衡系数 ％ROUTES------备选路径集 ％Num---------到各节点的备选路径数目 ％Cost-------
beibaowenti
- 有N件物品和一个容量为V的背包。第i件物品的费用是c，价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does
shibingzhandui
- 在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x和y的值才能使士兵们以最少的总移动步数排成一列。 -In a grid divided into the playground, n soldiers stood scattered points on the
Schlomer-N.-Guidelines-for-writing-clean-and-fast
- This document is aimed at MATLAB® beginners who already know the syntax but feel are not yet quite experienced with it. Its goal is to give a number of hints which enable the reader to write quality MATLAB® programs and to avoid commonl