The neighborhood condition for graphs to have [a,b]-factors containing no an matching;
图有不含匹配的 [a ,b]-因子的邻域条件(英文)
Support vector machine research in reservoir recognition based on neighborhood rough set;
基于邻域粗糙集与支持向量机的油层识别研究
Multi-objective evolutionary algorithm based on neighborhood;
一种基于邻域的多目标进化算法
Set Approximate Neighbourhood and Properties of Knowledge Universe Topology Spaces;
集合近似邻域与知识论域拓扑空间的性质
The neighbourhoods and the tabu list based on the process blocks are designed.
研究和设计了面向准时制生产作业计划的禁忌搜索详细算法，论述了该算法的基于工序块的邻域设计、禁忌表设计以及在两条变动的关键路线上所做的邻域搜索策略设计。
According to this conclusion,an improved algorithm of fractal coding based on matching in range block s neighbourhood searching was presented,and the .
根据这一结论,提出了一种基于邻域的螺旋式搜索方法,并利用图像块间的信息熵差值,缩减了搜索范围。
For A New Neighbor Condition on Up-Embeddabilitv of Graphs;
关于图的上可嵌入性的一个新的邻域条件
Under general relations,a variable precision covering rough set model based on neighbor is given by means of the error parameter β(0≤β<0.
5),给出了基于对象邻域的变精度覆盖粗糙集模型中β上近似、β下近似、β边界和β负域的定义以及β近似质量和β粗糙性测度定义;详细讨论了β上、下近似算子的性质、集合的相对可辨别性、该模型与Ziarko变精度粗糙集模型和覆盖粗糙集模型的关系;最后探讨了变精度覆盖粗糙集模型中的约简问题并在所给模型的基础上举例说明了它们在信息处理中的应用。
Firstly, the formula for updating particles is simplified by analyzing the cognition rule of individuals to their environment, the update of a particle location is only related to its own velocity and the optimal particle location in its neighborhood.
首先,通过分析社会个体对其环境的认知规律,简化粒子更新公式使粒子位置的更新仅与粒子自身速度及其邻域内最优粒子位置相关。
For the difficulty of getting transition probability matrixes in various directions in Markov chain(models),the paper presents a method to figure out it,which makes getting transition probability matrixes of (different) neighborhood systems of Markov chain models easier and more feasible.
针对在油气储层随机模拟中马尔可夫链模型的不同方向的转移概率矩阵求取困难的问题,提出一种二维剖面中不同方向的转移概率矩阵求取方法,这种方法的提出使得不同阶次的各向同性和各向异性的邻域系统的转移概率矩阵的求取变得容易可行。
The neighborhood system can’t cover the universe.
在含有缺省值的不完备性信息系统中,一部分对象无法确定的归入特定的类中,此时论域的邻域系统对于论域无法形成覆盖,只能形成论域的不完全划分。
Basing on the neighborhood system of MARKOV random field(MRF) and the potential function,we build a soft constrained mode to overcome the shortage of the force constraints,and we extend well constrained data to well-cross.
基于马尔柯夫随机域(MRF)的邻域系统及势函数构建一种软性约束模式,将井眼约束信息外推到井间,避免过往强制约束的不足。
Noise Filtering of Laser Scanned Data by Use of 3D Neighbors;
基于3D邻域激光扫描数据随机噪声滤波
In order to solve the distillation separation sequence synthesis problem effectively, super or neighborhood structure must be researched, and it is the foundation of realizing optimization algorithm.
本文运用组合数学理论深入研究了精馏分离序列综合问题,简明分析了有序剖分问题的计算复杂性;通过二叉树相邻切分点变换机制,实现了对精馏分离序列的随机搜索;提炼出后序遍历相邻变换的等价规则,从而构造出高效演化邻域结构。
This paper analyses those problems and propose a solutions that determined the pixel s feature value by using the vision perception information of pixel s neighborhood structure.
提出一种新的基于视觉感知特性邻域结构的纹理图像分割方法。
In this paper, we describe the optimization model and the neighborhood structure on the MSAP, then propose a scheme to solve the MSAP using Simulated Annealing Algorithm.
在描述多序列联配问题及其优化模型的基础上 ,构造了适合多序列联配问题的邻域结构 ,给出了一种使用模拟退火算法求解该问题的方案 ,并给出了该方案的一个实例 ,实验结果表明 ,模拟退火求解多序列联配问题是有效的 。