查询词典 minimum covering

A deterministic algorithm for global optimization is presented.The algorithm is one of covering methods which find the global minimum with required degree of accuracy.

提出了一种求解全局最优化问题的确定性算法，它属于求解带有给定精度的全局最优解的覆盖法。

Firstly, two covering hypersphere algorithms were proposed, referred to as minimum volume covering hypersphere algorithm and moving medium centers covering hypersphere algorithm, to heuristically and rapidly select the promising hidden center vectors from all the training samples. Then the particle swarm optimization algorithm combined with recursive orthogonal least square algorithm was used to further prune the initial hidden centers and optimize the control parameters.

为在实际应用中加速优化速度，降低优化计算复杂度，首先提出了最小体积覆盖超球和移动平均中心覆盖超球两种算法，用于启发式的从训练样本中快速的初选出径向基概率神经网络的隐中心矢量，然后将粒子群优化算法和 ROLSA 结合进一步优选隐中心矢量，同时优化核函数控制参数，实现径向基概率神经网络的全结构优化。

Based on these definitions, this thesis studied how the minimum covering radius, volume and density varies with r .

在这些定义的基础之上，通过理论分析，研究了半径、体积和密度等参数随 r 的变化情况。

Shockingly, the monthly payment you make to your credit counseling company may not even be covering your total minimum payments.

令人吃惊的是，每个月你对你的信用咨询公司，可能连你的书总的最低金额。

In this paper, maximum packing design and minimum covering design of two graphs with six vertices and nine edges are discussed.

本文中，两个六点九边图的最大填充设计与最小覆盖设计被研究。

The minimum set covering problem is an important NP-hard problem on hyper graphs.

最小集合覆盖问题是NP完全问题中非常重要的一个问题。

Results show that the energy function is Lyapunov stable and the network can be used for finding the minimum covering sphere of a polytope.

第七章 利用有理函数逼近的许多优良特性，构造了一种新的有理连分式链神经网络，给出了网络的一般拓扑结构图和学习算法。

References covering a minimum of four (4) years are recommended.

以上工作经历希望最少有四年。

Doing yoga a few times a week will work wonders for your body, mind, and spirit. Incorporating yoga into your everyday routine will change your life for the better, but for now we're just covering the bare minimum.

每周做几次瑜伽将对你的身体，头脑和精神产生奇迹般的作用（把瑜伽融入到你的日常生活中将会很好的改变你的生活，但是现在我们仅仅是练习瑜伽的最初级阶段）。

In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。

But in the course of internationalization, they meet with misunderstanding and puzzlement.

许多企业已经意识到了这一点，但在国际化的进程中，仍存在一些误区与困惑。

Inorder toaccomplish this goal as quickly as possible, we'll beteamingup with anexperienced group of modelers, skinners, and animatorswhosenames willbe announced in the coming weeks.

为了尽快实现这个目标，我们在未来数周内将公布与一些有经验的模型、皮肤、动画制作小组合作。