它们均是一种随机搜索的迭代算法，对优化对象的性态无要求。
They are a kind of stochastic search iterative algorithm and no demand of optimization object.
它们均是随机搜索的迭代算法，对优化对象的初始状态无要求。
They are stochastic search iterative algorithms and no demand of optimization object.
本文提出一种在频率域内直接估计随机动态系统的连续时间模型参数的快速迭代算法。
In this paper, a direct procedure for estimating the parameters of a continuous-time model of a dynamical stochastic system is presented.
方法：根据马尔科夫随机场图像模型，利用最大后验概率准则(MA P)，提出一种迭代松弛分割算法。
Methods: Based on Markov random fields model of noise, a iteration algorithm was presented by using maximum a posteriori (MAP) criterion.
假设我们有一个基于迭代器的算法，要求是随机访问迭代器。
Imagine that we have an iterator-based algorithm that requires random access iterators.
推导得到两种迭代学习辨识算法：迭代学习贝叶斯法和迭代学习随机牛顿法。
Two prototype algorithms of iterative learning identification, iterative learning Bayes and stochastic Newton algorithms, are proposed with detail.
在编码理论研究上，针对BCH最小码字距离提出基于迭代和随机方法的搜索算法。
Meanwhile, a theoretic study on the minimum distance of linear codes is made with a probabilistic algorithm given.
在编码理论研究上，针对BCH最小码字距离提出基于迭代和随机方法的搜索算法。
Meanwhile, a theoretic study on the minimum distance of linear codes is made with a probabilistic algorithm given.
应用推荐