1) sequential selection
序贯选择
2) sequential observation and selection
序贯观察与选择
1.
The sequential observation and selection problem is a class decision task of dynamic decision process,which describes the searching information stage by stage,and the aim is to decide when to stop searching for the maximal payoff.
序贯观察与选择问题是一类动态决策问题,描述了人们在优劣随机出现的备选择方案中,何时停止取样观察以获得最大的决策收益。
3) sequential feature selection
贯序特征选择
1.
The sequential feature selection method is studied for optimizing the feature set.
研究了舰船辐射噪声听觉特征的提取方法,包括美尔频率倒谱系数特征、语音动态参数特征等,组合成描述舰船的特征集,运用贯序特征选择方法对特征进行优化。
5) ranking selection
排序选择
1.
Exact schemata theorem based on ranking selection in evolutionary algorithms;
进化算法中基于排序选择下的准确模式理论
2.
A novel split-and-merge method with ranking selection(RSM) is proposed for the polygonal approximation of curves.
将遗传算法的排序选择策略引入到传统的拆分与合并算法,提出一种基于排序选择策略的拆分与合并算法(RSM)来求解平面数字曲线的多边形近似,解决了传统的拆分与合并算法对初始解的依赖问题。
3.
The ranking selection intensity adopts an adaptive adjusting mechanism, which can adjust the selection intensity dynamically according to the change of the population state.
提出一种改进的遗传算法,为排序选择压力引入自适应调节机制,确保选择压力随种群性状的改变而动态调整,采用新的竞争择优交叉策略提高种群中个体的平均性能。
6) selection sort
选择排序
1.
Sorting is very important in programming,and there are many methods,such as bubble sort, selection sort, insertion sort,etc.
排序是程序设计中非常重要的内容,其方法有很多,常用的有三种:冒泡排序、选择排序和插入排序。
2.
selection sort, insertion sort) are improved and these algorithm complexities are analyzed.
本文对三种简单排序方法———冒泡排序、选择排序、插入排序分别进行了改进 ,进行了相应的算法复杂度分析 ,并编出程序上机实验 ,对改进的算法与原算法所运行的时间进行了比
3.
This paper discusses an improved algorithm based on selection sorting,which employs stacks to remember previous compared information.
针对少量记录排序的应用,对直接选择排序算法进行了挖掘,通过增加记忆功能,使算法性能得到明显提高。
补充资料：观察(见科学观察)
观察(见科学观察)
observation
吝。guaneho观察(observation)见科学观
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条