The experimental results have proved that the method has improved the efficiency of algorithm programming and abridged the development cycle of product.
实验结果表明：该方案提高了常见算法的编码实现效率，缩短了产品开发周期。
Xi'an has been selected the well-known tourist attractions, the attractions for the transformation and normalization of the algorithm programming experiment.
选取了西安的著名旅游景点，对景点进行了变换和归一化，对算法编程进行实验。
In imperative programming languages, I must think about each atomic step in my algorithm.
在命令式编程语言中，我们必须在算法中考虑每个原子步骤。
This might mean being able to undertake detailed design of a key aspect of the system, even to the point of being able to represent a critical algorithm in a programming language.
这意味着他们能够承担系统的某一关键方面的设计，甚至是用某种程序设计语言表现一个关键的算法。
The Dynamic Programming algorithm is best understood by drawing a grid whose rows correspond to the letters of the source, and whose columns correspond to the letters of the target.
为了更好地理解动态编程算法，可以画一个表格，它的行对应源单词的字母，它的列对应目标单词的字母。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
Since the development of the simplex algorithm, linear programming has been used to solve optimization problems in industries as diverse as banking, education, forestry, petroleum, and trucking.
由于simplex算法的出现，线性编程已经在工业界、银行界、教育界、林业、石油行业以及运输业界中广泛地用来解决优化问题。
In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年，George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
DRBD USES the Linux crypto application programming interface and is therefore flexible on the integrity algorithm used.
DRBD使用Linux加密应用程序编程接口，因此在完整性算法使用方面是比较灵活的。
This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
Be inspired from natural plant growth, this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.
从大自然植物生长中得到启发，提出了一种求解非线性整数规划全局最小解的仿生算法。
The algorithm is of the isochronic and discrete dynamic programming.
该算法是一种等时性离散动态规划法。
The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.
算法的实现难易程度由动态规划算法到多项式算法依次提高。
Introduced the principle of CMAC. Improved it's performance in various aspect, and realized CMAC algorithm by programming.
介绍CMAC原理，针对基本CMAC算法的不足，从多方面对其进行改进，最终编程实现了CMAC算法。
This algorithm is simpler than analytic simulation programming, and needs lesser storage and has higher precision in contrast to the discrete simulation.
该算法比解析模拟算法编程简单，比离散模拟算法存储空间小、计算精度高。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
In a programming algorithm we must likewise make sure that we don't have any edges in the priority queue that lead to vertices that are already in the tree.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
Improved on the traditional tree matching with dynamic programming algorithm.
改进了传统的树匹配和动态规划算法。
Finally realized the inverted pendulum system's practicality control by each kind of intelligent control algorithm through programming, and obtained the satisfying control effect.
最后通过编程实现了各种智能控制算法对倒立摆系统中的实物控制，均取得了令人满意的控制效果。
A ground control point based stereo matching algorithm via iterative dynamic programming is proposed.
提出一种基于地面控制点的迭代动态规划立体匹配算法。
Algorithm is the kernel of programming.
算法是计算机程序设计的核心。
Both continuous and discrete nonlinear programming algorithm are adopted.
应用连续与离散非线性规划算法计算。
The planning track that is gotten from dynamic programming algorithm sometimes can not achieve the aimed target.
通常所使用的动态规划算法得到的规划航迹有时达不到目标点。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
The optimization problem is solved with the sequential linear programming algorithm.
优化问题求解采用序列线性规划算法。
In this paper, a new linear programming algorithm of optimization design for cylindrical spiral spring is introduced.
本文给出了圆柱螺旋弹簧优化设计的一种新算法——线性规划算法。
In this paper, the descending dimension algorithm for nonlinear programming problems with linear equality constraints are discussed.
本文研究含有线性等式约束的非线性规划问题的降维算法。
In this paper, the descending dimension algorithm for nonlinear programming problems with linear equality constraints are discussed.
本文研究含有线性等式约束的非线性规划问题的降维算法。
应用推荐