分支
- 与 分支 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Magnetic Resonance Imaging, Integer Programming, Branch and Bound Method, Shimming
磁共振成像;整数规划;分支定界法;匀场
-
Corresponding to such a NP-hard problem, this paper gives some polynomial time solvable cases, and a branch and bound algorithm with a rapid method for estimating the lower bound for general case.
对这一NP-困难的排序问题,文中给出了几个多项式可解的特殊情形,一般情况下的一个快速下界估计方法以及相应的分支定界算法。
-
In order to implement nonlinear predictive control for the controlled plant, a T-S fuzzy predictive model is built on-line by using fuzzy clustering and linear identification, and discrete optimization of the control action is carried out according to the principle of Branch and Bound method.
算法由两部分组成:第一部分采用模糊聚类和线性辨识方法在线建立系统的T-S模糊预测模型;第二部分基于分支定界法的基本原理对控制量进行离散寻优,从而实现对象的非线性预测控制。
-
Secondly, the research methods of the pallet loading problem are induced. Branch and Bound Method is analysed. Upper bounds for the Pallet Loading Problem are summerizaed.
接着,归纳了装盘问题的研究方法,分析了分支定界方法,重点总结了装盘问题中的定界算法。
-
We study the optimal properties of the problem 1 |p_j=a or a+b_j, d |∑w_jC_j and according to it a kind of GA implement and a kind of Branch and Bound method are given.
本章考虑了单机分段恶化排序问题1| p_j= a or a+b_j, d |∑w_jC_j根据最优解的性质给出了遗传算法和分支定界法。
-
The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.
全书分为3个部分:第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析;第二部分针对排序问题和图的问题,讨论各种已有的算法,并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法,并介绍了计算的复杂性以及NP完全问题;第三部分讲述并行计算模型和并行算法设计技术。
-
For the above problem, two heuristic methods and a hybrid optimal algorithm that incorporates the branch and bound method with active schedule constru〓n algorithm are presented Computational results show the effectiveness of these methods.
对上述问题,给出了两个启发式方法和一个将分支定界法和活动调度构造算法相结合的混合最优算法。
-
In this paper according to the principle of pre run time schedule,we propose a method of how to abstract a real system to the schedule module;how to find a valid solution or optimal solution by using branch and bound method and how to realize it in computer finally.
本文根据预调度原理提出了如何将现实系统抽象成调度模型;如何利用分支限界算法找到可行解或优化解以及如何在计算机上实现它,最后用测试实例验证了它的可行
-
The given Branch and Bound method can find out the optimal solution of the problem in small size while the given GA implement can quickly find out the approximate optimal solution of the problem in large size. The given GA implement proves to be very effective by numerical experiments and examples.
对于问题的较小规模情形分支定界法能精确地求得最优解;对于问题的较大规模情形遗传算法能很快地求得近似最优解;算例及大量实验表明用遗传算法来求问题的近似解是成功的。
-
By means of Heuristic Search, Branch and Bound method and Voronoi Diagram, the algorithm analyzes occlusion on complicated denture models precisely and quickly, which solved the practical problem in the application of VR technologies in dentistry.
通过推广基于分离轴定理的经典碰撞检测算法,借助启发式搜索、分支定界和Voronoi图等手段,算法可以在较短的时间内对复杂牙列模型完成高精度的定量咬合分析任务,解决了虚拟现实技术在口腔医学领域应用中的实际问题。
- 推荐网络例句
-
Do you know, i need you to come back
你知道吗,我需要你回来
-
Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.
1〕 杨银书,王祥生,李德昌。安徽省首次发现嗜群血蜱。
-
Chapter Three: Type classification of DE structure in Sino-Tibetan languages.
第三章汉藏语&的&字结构的类型划分。