位置：成果数据库 > 期刊 > 期刊详情页
Fast Computation of Shortest path for Visiting Segments in the Plane
  • ISSN号：1874-110X
  • 期刊名称：The Open Cybernetics & Systemics Journal
  • 时间：2014
  • 页码：224-229
  • 相关项目：基于计算几何与图论的动态目标协作搜索机制及其算法研究
作者： Wang, Lijuan|Jiang, Bo|Deng, Ansheng|Wei, Qi|
同期刊论文项目
基于计算几何与图论的动态目标协作搜索机制及其算法研究
期刊论文 23 会议论文 21 著作 1
同项目期刊论文
访问平面内不相交线段ESP问题的最优求解算法及其验证
Assessment of E-learning System in Higher Education Based on Hesitant Fuzzy Information with Incompl
Galerkin Finite Element Method by Using Bivariate Splines for Parabolic PDEs
The Shortest Path of Touring Lines given in the Plane
Searching a polygonal region by two guards
Characterizing and recognizing LR-visibility polygons
A New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons
填充函数法改进的BP网络SPDS算法
基于多层前馈神经网络SPDS算法的地质数据非线性分析问题研究
Minimization of the maximum distance between the two guards patrolling a polygonal region
Searching for mobile intruders in circular corridors by two 1-searchers
BP网络的SPDS算法的局部极小问题分析
Optimum sweeps of simple polygons with two guards
Research on Emergency Resource Scheduling in Smart City based on HPSO Algorithm
Spline method for solving generalised Fisher–Kolomogrov–Petrovskii–Piskunov equation
Searching for Mobile Intruders in Circular Corridors by Three 1-Searchers
Security protection technology of cyber-physical systems
Research on the algorithm for Euclidean shortest paths of visiting line segments in the plane
基于决策规则的属性约简算法研究