合法的选择策略包括选择列表中的第一个服务、从列表中随机选择服务或使用一些用户定义的算法。
Valid selection policies include selecting the first service in the list, selecting a service at random from the list, or user some user-defined algorithm.
为优化无中心式调度框架下网格作业的节点选择，提出了随机多起点爬山算法。
To optimize node selections for grid jobs under de-centralized scheduling frameworks, the algorithm of random multi-start hill climbing is proposed.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
该文介绍了随机决策树分类模型及如何启发式选择随机决策树的深度及棵树，通过实验证明了该算法的有效性和高效性。
This paper introduces the classification model of random decision tree and how to heuristic selected the depth and the number, the experiment shows that the algorithm is effectiveness and efficiency.
该算法引入二次余数理论随机选择嵌入位置，并且采用了一种扩展的编码机制动态地隐藏秘密信息。
The quadratic residue theory was used for selecting randomly the embedding positions, and an extended coding scheme is utilizing for dynamically hiding secret messages.
在考虑网络中用户的路径选择行为满足概率型随机平衡的条件下，给出了交通网络设计的双层规划模型，同时设计了基于差分的启发式求解算法。
On the condition that the stochastic equilibrium restraints are satisfied as the network clients select the path, the author presents bilevel planning model for traffic network design.
实验结果表明：相对于随机调度算法，基于溯源信息的设备选择算法使得用户满意程度达80%。
Simulations show that the provenance based equipment scheduling algorithm increases user satisfaction to 80% compared with the random scheduling algorithm.
然而，由于聚类初始中心点选择的随机性，传统K -均值算法以及其变种的聚类结果会产生较大的波动。
However, owing to random selection of initial centers, unstable results were often obtained while using traditional K-means and its variants.
换句话说，让我们学习算法告诉我们，到标签的实例，随机选择，而不是他们。
In other words, we let the learning algorithm tell us which instances to label, rather than selecting them randomly.
在基本蚁群算法的基础上，用确定性选择与随机性选择相结合的方法对节点的状态转移规则进行改进。
Grid method was applied to establish an environment model. The conversion rule of node state was improved by combining decided selection with random selection.
通过对信息素更新策略、局部搜索算法、随机选择概率三个方面的改进，提高算法的全局最优搜索能力和收敛性。
Based on the pheromone updating strategy, local search algorithm, the probability of randomly selected three areas to improve, improve the algorithm's global search ability and convergence of optimal.
该方法较原来的随机选择过程简单，且减少了遗传算法的种群规模。
This method is more simple than original stochastic choice process , also reduces the GA population scale.
该方法较原来的随机选择过程简单，且减少了遗传算法的种群规模。
This method is more simple than original stochastic choice process , also reduces the GA population scale.
应用推荐