可计算的 meaning in English
calculable
computable
countable
reckonable
Examples
- Agents distributed on different sites dynamically inspect and adjust the situation of the key work centers . they communicate and collaborate with each other in time in order to adjust the capacity and load when situation needed
通过多个可计算的分布在不同结点的agent对各关键工作中心进行动态监控与调整，并及时与其它agent通讯，以及多agent间的协作来完成能力与负荷的调整。 - Expertise helps foundations take calculated risks ? as an entrepreneur might and as governments rarely do well ? and achieve the economies of scale that make as much difference in charitable work as in any other sphere of life
专业化可以帮助基金会把风险控制在可计算的范围内? ?创业者们都会这么做而政府机构往往在这方面并不擅长? ? （专业化）也使基金会可以达成规模效应（译注2 ） ，而这是慈善活动与其它生活领域的活动的一大不同之处。 - This paper tries to resolve this problem by redesigning the software architecture of distributing parallel schedule model to improve the system " s adaptability and extensibility . this paper is balanced as following . firstly , this paper studies the characters of distributed parallel schedule that required by the trend of distributed parallel computing and criticizes the existing solution to these problems ; secondly , this paper develops a extensible and adaptive distributing parallel schedule to resolve these problems ; finally , this paper offers three key experiments to verify the rationality of the solution and then draws conclusion
本文安排如下：首先，在引入研究问题的基础上，讨论分布并行的调度模型所需要具备的新的特征以及给出这些特征的一个可计算的解决方法；然后，在此基础上提出一种新的分布并行调度的设计模型，该模型重点解决分布并行调度的设计结构对可扩展性，自适应性的制约问题；接着，基于上述讨论结果提出了分布并行调度器设计和实现上的具体应用实例；最后，通过试验的方法讨论了该实际模型的性能并对本文进行简要总结。 - Since idm is based on the constructing and computing of computable decision rules , for any idm problem , if the general mathematical model of its decision rules can be constructed , then solving of the intended idm problem is reduced to searching the best parameters for that model . thus ec can be made used of
智能决策通常通过设计满足目标要求的可计算的决策规则实现，对待求解的决策问题，如果能够设计出普遍适用的可计算的决策规则模式，则原决策问题就归结为寻找最佳决策规则参数的优化问题，因而可以用进化计算求解。 - Methods of random search don ’ t require gradient calculations , but tend to be slow , and susceptible to getting stuck in local minima . genetic algorithm optimizer is robust global search method , and its research is based on probability , having advantage of no restraint of differentiable and continuities and avoiding getting stuck in local minima
而遗传算法只要求待解问题是可计算的,并对目标函数无可微性、连续性等条件的限制,同时,该算法是一种基于概率的鲁棒性很强的随机化全局搜索技术,其搜索过程具有一定的方向性,能够有效克服未成熟收敛。