（用过）离散微分算法（Discrete differentiation）动态筹划算法（Dynamic Programming）——展示相互包围的子题目和最优子架构算法。（用过，加密后续通信。
基于159个网页-相关网页
提出了一种求解离散优化问题的双种群二进制微分进化算法。
A binary differential evolution algorithm with dual subpopulations algorithm for discrete optimization problems is proposed.
该算法对离散的曲线进行光顺、拟合和采样，使用空间曲线微分几何性质计算各采样点的曲率和弗朗·内特标架。
After smoothing, fitting and sampling the discrete space curves, the algorithm calculated Frenet frame and curvature for each sampling point.
应用推荐