To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
By the convergence of the method, we can fast construct a COSTBC matrix with the maximal rates and the minimal decoding delays that we all know now recur to the computer.
利用该方法良好的收敛性，可以借助于电子计算机快速的构造目前已知的具有最大码率和最小解码时延的多天线复正交空时分组编码矩阵。
The paper introduces a method of fast decoding RS code. It USES the singularity of syndrome matrix to find out the error locations of RS codes.
介绍一种快速RS译码方法，利用伴随矩阵的奇异性找出RS码的错误位置。
A decoding software system is also developed, which can be used to convert the structure code concerned into connection matrix method.
已开发出的解码软件成功地实现了结构代码向联结矩阵的转化，从而为基团贡献法组合相应的基团奠定了基础。
A decoding software system is also developed, which can be used to convert the structure code concerned into connection matrix method.
已开发出的解码软件成功地实现了结构代码向联结矩阵的转化，从而为基团贡献法组合相应的基团奠定了基础。
应用推荐