1.
On the Existence of Minimal Convex Generated Set in the Open Set of E~n;
E~n中的开集不存在最小凸生成集
2.
Research for Generating Min-Area Convex Encasing Box for Arbitrary Closed Contour Based on Genetic Algorithm;
基于遗传算法的封闭轮廓最小面积凸包围盒生成算法
3.
Rapidly Generating Algorithm for Minimum Test Case Set on MC/DC
MC/DC最小测试用例集快速生成算法
4.
Fund Performance Evaluation Based on Minimum Convex Input Requirement Set Approach;
基于最小凸输入需求集方法的基金业绩评价
5.
Henig Proper Efficiency in the ic-Conen-Convexlike Set-valued Optimization Problems
生成锥内部凸-锥-类凸集值优化问题的Henig真有效性
6.
Novel connected dominating set algorithm based on minimum spanning tree
基于最小生成树的连通支配集求解算法
7.
Fast Algorithm for Convex Hull Generation Based on Spatial Division of Scattered Point-Set
基于散乱点集空间划分的凸壳体快速生成算法
8.
The Method of Minimum Convex Input Requirement Set (MCIRS) for Evaluating the Open-end Funds and Its Application;
评价开放式基金业绩的最小凸性投入需求集方法及其应用
9.
Close-ended Fund Achievement: A Research based on Minimum Convex Input Request Set Approch;
封闭式基金绩效:一种基于最小凸投入要求集的研究
10.
Algorithm for smallest quadrangle encasing box of convex polygon
凸多边形最小面积四边形包围盒算法
11.
The minimal norm control problem in averagely uniformly convex Banach spaces
平均一致凸Banach空间的最小范数控制
12.
Research on the Integration of Globoidal Cam Mechanism CAD/CAM/CNC;
弧面分度凸轮机构CAD/CAM/CNC集成研究
13.
A fast algorithm for mining maxmum frequent itemsets;
基于集合运算的最大频繁项目集生成算法
14.
On Cayley Graph of 2~3P Order-graphs of a Simple Generic Set;
2~3p阶群的一组最简生成元集的Cayley图
15.
The Design and Analysis of Algorithms on the Minimum Spanning Tree and Second-best Minmum Spanning Tree;
最小生成树与次小生成树上的算法分析与设计
16.
On the Set of Lagrangian Multipliers of Nonconvex Optimization Problems;
关于非凸最优性的拉格朗日乘子集问题
17.
How many at most Obtainble Polyhedral Convex Sets Cut a R~k by n Hyperplanes;
n个超平面分R~K最多能得多少个多面凸集
18.
Some Latest Advances in Upper Convex Density
关于自相似集的上凸密度研究的最新进展