动态排序 meaning in English
dynamic ordering
Examples
- In this paper , we also make entail research about the air traffic flow in the terminal area , and then bring forward a new plane queue sequencing algorithm : a passively insert - in style and dynamic sequencing window
有了上述基础，本论文再提出一种新的飞机队列排序算法，引入了被动插入式动态排序窗的概念，不同于现在国际和国内所使用或正在研究的算法，本算法在无空中交通拥挤时遵守“先到先服务”服务规则。 - Different form other sequencing algorithm , the algorithm only need to compute the plane queue in the dynamic window , which is came into being around the new arrival plane . as a result , this algorithm is good at both optimization efficiency and computation
当发生空中交通拥挤时，先在刚到达的飞机的前后建立一个动态排序窗，计算时，只需对窗内的飞机队列进行排序，即只需对与刚到达飞机相关的飞机进行处理。 - Application of genetic algorithm in data mining has been studied . based on gene hypothesis gene dynamic sort method has been brought forward . its feature is component of genes can become longer and better gene component and because of dynamic sort , good gene component can be kept effectively
在分类规则提取系统中，为了更好地提高算法的寻优和保优能力，提出了基因动态排序方法，即把各基因位按重要性大小进行排序，在此基础上再进行交叉操作。 - 3 ) the on - line scheduling problem with constrains relationship is studied . we use generalized preemption models to study the dynamic single - machine scheduling problems of minimizing total weighted completion time and develop on - line optimal dispatching rules , which consider only available information
给出了在一般化可中断模型下，考虑任务之间存在优先约束关系时，具有任意的和未知的任务到达时间的最小化加权总完工时间的单机动态排序问题的在线调度规则。 - According to the number of processors , scheduling problem can be grouped as single - machine scheduling problem and multi - machine scheduling problem . according to whether the job ' s processing time , released time and the surroundings of the processors are deterministic or stochastic , scheduling problem can be grouped as deterministic scheduling problem and stochastic scheduling problem . according to whether the parameters of the jobs are given before - hand , scheduling problem can be grouped as static scheduling problem and dynamic scheduling problem
按处理机个数将排序问题分为：单机排序问题和多处理机排序问题；根据任务加工时间和到达时间以及处理机的工作环境等数据是确定的或服从某种随机分布可分为：确定性排序问题和随机排序问题；根据所有任务的参数是否是预先给定的可分为：静态排序问题和动态排序问题。