1) Bellman principle
bellman原理
1.
This paper used the theory of Function S-Rough Sets to realize the matching of dynamic mode between reference mode and test mode,and then calculate the Levenstein distance with dynamic programming algorithm of Bellman principle.
应用函数双向S-粗集理论实现参考模式和测试模式的动态模式匹配,用Bellman原理的动态规划算法实现全局约束定义下的Levenstein距离的计算,以此确定出参考模式和测试模式的距离测度,有明显降低计算复杂度的效果,并以无纸考试系统非标准化试题的智能评分为例进行说明。
2) Bell man optimization mechanism
Bellman最优化原理
1.
The successful experience was introduced of rolling the thin walled channel beam- 7 5 #?10 #?15 # to export, which applied Bell man optimization mechanism to design pass system Mean while,the influence factors on finishing product rate were analyzed,and the resolution methods were put forwar
介绍了济钢中型厂采用Bellman最优化原理优化孔型设计 ,一次性成功轧制出 7 5 # 、 1 0 # 、 1 5 #出口薄壁槽钢的成功经验 ;分析了影响成材率的主要因素 ,并提出了相应措施。
3) the principle of Bellman stochastic optimization
Bellman随机动态最优化原理
4) Gronwall-Bellman lemma
Gronwall-Bellman引理
1.
This paper proves Gronwall-Bellman lemma in three ways when its integral interval changed from [0,t] to [t,T].
本文用三种方法证明了Gronwall-Bellman引理中的积分区间[0,t]变为[t,T]的情形。
5) Bellman-Ford algorithm
Bellman-Ford算法
1.
Bellman-Ford algorithm is used to search a minimum risk path of UAV from the origin to.
采用Bayes方法求取了给定规划区域内威胁存在的概率,构建了威胁概率分布图,并将其转化成权重为威胁概率的带权图,利用Bellman-Ford算法搜索该带权图,求取了一条从出发点到目标点的无人机最小威胁路径,根据无人机气动性能约束,对最小威胁路径进行了修正和优化,得到一条可飞的最优路径,最后给出了仿真结果,验证了方法的有效性。
2.
It is well known that Bellman-Ford algorithm is one of best algorithms on the shortest path problem with negative weights since 1958.
Bellman-Ford算法自1958年以来一直是负权最短路问题的公认的最好算法之一。
3.
DMRMQ uses a modified Bellman-Ford algorithm, can build a least hops and costs multicast tree after satisfying bandwidth, delay, delay jitter and loss constraints.
提出了一种基于多QoS的动态组播路由算法-DMRMQ,该算法采用Bellman-Ford算法作为路径搜索算法,能在满足带宽、延迟、延迟抖动和丢包率的前提下确定具有最小跳数和开销的动态组播路由。
6) Bellman inequality
Bellman不等式
1.
The Generalization of Bellman Inequality
Bellman不等式的推广
2.
On the foundation of this, it is further proved that by means of nonnegative, decreasing and trending to zero infinite sequence {a k}, the Bellman inequality can be generalized to the wider form∑∞k=1(-1) k+1 f(a k)≥f(∑∞k=1(-1) k+1 a k) under the same weak condition.
讨论了弱条件下的两个 Bellman诱导不等式 ,证明了 Bellman不等式仍能在弱条件下成立 。
3.
This paper discuses some inequalities for the trace of unlikely symmetry matrices product,and gives the condition of Bellman Inequality for the idenpotent matrices hold.
研究一些未必对称的矩阵乘积的迹的不等式 ,给出了关于幂等矩阵Bellman不等式成立的条
补充资料：Bellman-Harris过程
Bellman-Harris过程
Bellman - Harris process
Bellman一Ha币s过程【决l恤幼一Ha州5 pl、x犯ss;B洲1-Maoa一Xapp.ea uPo”eee」 年龄相关分支过程咬branchingp~55，a邵一de-户泪dent)的一种特殊情形.首先由R.Bellman和T.EHarris(川)加以研究.在Bellman一Harris过程中，假定诸粒子彼此独立地在一随机时期内生存，且在它们生存时间的终了产生随机多个新粒子.若G(t)为诸粒子生存时间的分布函数，h(s)为每个粒子下一代数目的母函数，且在t二0时粒子的年龄为O，则粒子数川O的母函数F(t;s)=〔s刚满足非线性积分方程 F(‘;s)二{人(F(‘一u;、))d‘(u)一干、(l一G(‘)). }如果 石仃)二1一。，一入，l)()，则Bellman一Harris过程是一连续时间MaPKoB分支过程.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条