研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
提出了一种基于梯度投影矩阵下的求解线性约束下规划问题的神经网络。
A novel neural network is proposed, which solve the programming problems with linear restraints based on gradient projecting matrix.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
提出利用神经网络和模拟退火技术来求解有约束的FMS资源调度问题的一种新方法。
In this paper, an approach for resource constrained FMS scheduling is described, which integrates Hopfield neural network and simulated annealing algorithm.
这些新的结论都表明了该神经网络在求解有界约束二次规划问题时的有效性。
All these new results show the validity of the network in solving quadratic optimization with bound constraints.
算法将网络训练看成是求解一个优化问题，网络权是优化变量，而先验知识则是优化问题中的约束项。
It takes the network training process as to solve a nonlinear optimization problem. The network weights are optimization variables and prior-knowledge is the constraint.
目的建立求解一类线性约束非线性凸规划的简单可行的神经网络。
AimTo construct the simple and feasible neural networks for solving a class of linearly constrained convex programming problems.
研究了由MSN节点组成的应用层组播网络，讨论了度约束最小直径生成树(D - MDST)问题，并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for Degree-constrained Minimum Diameter Spanning Tree (D-MDST) problem.
这里考察了求解无约束总体极小化问题的神经网络方法，提出了一种新的网络求解模型。
Neural network method for solving global unconstrained minimized problems was investigated and a new neural network model was then proposed.
该设计方案主要是充分利用网络的软硬件资源，将网络上的多个求解器通过互相协调共同解决一个等式约束问题。
The scheme make full use of the network resource of software and hardware, and make the multi-solver in network solve a equation constrained problem by working coordinately each other.
配电网络重构是在满足各种运行约束条件下，以网损最小或供电可靠性最高为目标，它是一个典型的非线性整数组合优化问题，常规的数学优化方法难以求解。
The purpose of distribution network reconfiguration is to obtain the minimum network loss and the maximum reliability while meeting all kinds of operational restrictions.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
为求解通信时延受约束的低能耗片上网络(NoC)映射问题，提出一种改进禁忌搜索算法。
An improved tabu search algorithm is proposed to solve the low energy network-on-chip (NoC) mapping problem subject to communication latency constraints.
该算法基于点簇对约束网络图进行归约，求得归约序列然后重构几何模型，具有求解速度快、可靠性高、应用范围广等优点。
The reduction is carried out by using geometric constraint graph based on the point clusters. Then the sequence of reduction is computed and the geometric model is rebuilded.
该算法基于点簇对约束网络图进行归约，求得归约序列然后重构几何模型，具有求解速度快、可靠性高、应用范围广等优点。
The reduction is carried out by using geometric constraint graph based on the point clusters. Then the sequence of reduction is computed and the geometric model is rebuilded.
应用推荐