说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 最近邻域搜索算法
1)  The shortest neighborhood search algorithm
最近邻域搜索算法
2)  k-nearest Neighbor search algorithm(KNNs)
k最近邻搜索算法
1.
k-nearest Neighbor search algorithm(KNNs) can not satisfy the needs of distributing,real time performance and expansibility for data mining.
k最近邻搜索算法无法满足数据挖掘的分布性、实时性和可扩展性要求,针对该问题提出基于P2P的自适应分布式k最近邻搜索算法[0](P2PAKNNs)。
3)  nearest-neighbor search
最近邻域搜索
4)  Approximate Nearest Neighbors(ANN)
近似最近邻域搜索
5)  variable neighborhood search algorithm
变邻域搜索算法
1.
Application of evolutionary variable neighborhood search algorithm to location-allocation problem in close-loop supply chain;
用进化变邻域搜索算法求解闭合供应链选址问题
2.
A two-stage variable neighborhood search algorithm was designed to solve the problem, and the algorithm solves the problem by optimizing the average rolling length first and optimizing hot charge rate secondly.
提出了一种两阶段变邻域搜索算法,该算法按照先优化平均单元计划轧制长度后优化热装比的顺序求解该问题。
6)  variable neighborhood search
变邻域搜索算法
1.
A variable neighborhood search algorithm was presented to solve the no-wait flow shop problem with makespan criterion.
仿真实验证明了变邻域搜索算法的有效性。
2.
A new metaheuristic algorithm,the variable neighborhood search(VNS),has been successfully used to solve optimizaiton problem,especially for the largescale combinational optimization problem.
变邻域搜索算法(Variable Neighborhood Search,VNS)作为一种新的元启发式算法,已初步成功地用于解决优化问题,尤其是对于大规模组合优化问题效果良好。
补充资料:最近
1.指说话前或后不久的日子。 2.极为接近。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条