neighborhood topology

neighborhood topology的基本解释

-

邻域拓扑

与neighborhood topology相关的网络例句 [注：此内容来源于网络，仅供参考]

Based upon the idea of space partition and object decomposition, topological components of an area object with holes are defined by the use of the concept of neighborhood in the point set topology, which is a natural extension of the definitions for topological components of a simple area.

本文基于空间划分和目标分解的思想，利用点集理论中的邻域概念详细分析和描述带孔洞面目标的点集拓扑分量，这种描述方法实质上是简单面目标点集拓扑分量描述的一种自然延展。

Particle swarm optimizer with neighborhood topology on particle swarm performance.

Kennedy[9]于1999年提出几种基本的领域结构，如环形结构和轮形结构及它们的推广。

Experimental simulation results demonstrate that dynamic probabilistic particle swarm optimization with the varying neighborhood topology can solve complex optimization problems and escape from local optimal solutions efficiently.

实验结果表明，基于多簇结构的可变拓扑策略在求解复杂优化问题时优势明显，可以有效地避免算法陷入局部最优，在保证收敛速度的同时增强了算法的全局搜索能力。

Furthermore, the information dissemination of several topologies is analyzed theoretically, and the statistical properties of canonical topologies and varying neighborhood topology are analyzed from graph theory.

针对传统粒子群优化算法中全连接型拓扑和环形拓扑的特点，引入了一种粒子群信息共享方式——多簇结构，进而基于多簇结构提出了动态可变拓扑策略以协调动态概率粒子群优化算法的勘探和开采能力，并从理论上分析了最优信息在各种拓扑中的传播，同时从图论角度分析了几种经典拓扑以及动态可变多簇结构的统计特性。

Some novel algorithms and mechanisms are proposed, such as neighborhood invariant topology rule, Kautz_hash naming algorithm, and local optimum self-stabilization mechanism, to optimize the FissionE topology and improve the performance of FissionE, and they have been carefully investigated by the theoretical analysis and formal correctness proofs.

本文提出了一系列创新性的机制和算法，包括"邻居关系不变量"拓扑构造机制、Kautz_hash命名算法和"局部优化"动态维护机制等，以有效优化FissionE拓扑，提高FissionE方法的定位性能。

与neighborhood topology相关的网络解释 [注：此内容来源于网络，仅供参考]

neighborhood topology：邻域拓扑

neighborhood system 邻域系 | neighborhood topology 邻域拓扑 | neighboring vertex 邻近项点