提出了一种基于竞争的配电网络优化规划算法。
An algorithm based on competition optimal planning of power distribution networks is suggested.
提出一种基于全局优化的动态规划算法以进行超声多普勒血流信号最大频率曲线的提取。
A dynamic programming algorithm based on the global optimization is presented to extract the maximum frequency waveform of the Doppler ultrasound blood flow signal.
优化问题求解采用序列线性规划算法。
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.
提出一种在未知动态环境中进行启发式优化搜索的实时路径规划算法。
The paper proposed an optimal path-planning algorithm for dynamic environment with multiple robots (obstacles).
其中根据各样本重要性的不同，引入了加权支持向量机方法，然后利用免疫规划算法对其进行参数优化。
The immune programming algorithm, inspired by the immune system of human and other mammals, was used to optimize the parameters of weighted support vector machines.
结果表明对于数据量庞大的非线性模型的优化求解，改进后的进化规划算法具有更强和更广泛的适用性。
The result shows that improved evolutionary programming is much more appropriate of none line model with a great volume of data.
对于未知环境下的路径规划，要求机器人有适应不同环境的能力，能针对不同环境自动调整规划算法以优化路径。
For path planning in the unknown environment, it is useful that the robot can modify its algorithm to optimize the path, so that it can be adaptive to different kinds of environments.
该参数优化算法可在对偶松弛凸可分规划算法的主循环之外，通过少量参数化扩展得到。
Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.
在给定的约束条件下，几何规划算法可以全局性地高效解决电感器各竞争目标（如品质因数与所占面积）之间的优化折中问题。
This algorithm can globally and efficiently solve the tradeoffs between the inductor competing objectives, such as the quality factor and the area.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
演化规划算法是解决多目标优化问题的算法之一。
Multiobjective evolutionary programming is one of available methodologies for multiobjective optimization.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
然后结合动态规划的基本原理，改进了算法的步长，从而得到了求解该问题的优化的动态规划算法。
Then a new algorithm based on dynamic programming is proposed through improving the step-length. Finally, the complexity of the algorithm is analyzed.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
提出了一种新的时钟偏斜规划算法，该算法所生成的时序约束可以有效地促进逻辑综合工具的面积优化。
A new clock skew scheduling algorithm is proposed. This algorithm generates timing constraints which can effectively promote the area optimization of logic syn thesis.
提出了一种新的时钟偏斜规划算法，该算法所生成的时序约束可以有效地促进逻辑综合工具的面积优化。
A new clock skew scheduling algorithm is proposed. This algorithm generates timing constraints which can effectively promote the area optimization of logic syn thesis.
应用推荐