在CSimpleBinaryTree 中有两个搜索算法.线性搜索和对半搜索.线性搜索只在树种子项数目小于指定值的时候才使用 (缺省为10),从这个点以后的各项，将使用对半搜索.这样做的原因是线性查找不要求元素进行排序并且它的运算规则相对要简单的多.因此对于小数目项来说，线性查找是理想的.
The reason for this is that a linear search doesn't require the elements to be sorted and its algorithm is a lot less complicated. So for a small number of items a linear search is ideal.
针对大型、复杂油田供水管网的流体网络系统，建立了油田供水管网系统的仿真数学模型，给出了一种子系统自动划分的算法。
According to the large and complicated float net of oil flooding system, found math model of oil water flooding system and brought forward the algorithm of subsystem auto-partition.
然后，运用凸优化技术分析了该资源分配问题，并基于拉格朗日对偶法给出了一种子载波和功率最优分配算法。
Then, by use of multiple carrier system's frequency-sharing property and convex optimization, a subcarrier and power optimal allocation algorithm is proposed based on Lagrangian duality theory.
文章提出在空时分组编码的MIMO系统中利用OPAST这种子空间追踪算法进行盲空时多用户检测。
In this paper, the orthogonal projection approximation subspace tracking (OPAST) is employed for channel estimation and space-time multiuser detection in space-time block coded MIMO system.
文章提出在空时分组编码的MIMO系统中利用OPAST这种子空间追踪算法进行盲空时多用户检测。
In this paper, the orthogonal projection approximation subspace tracking (OPAST) is employed for channel estimation and space-time multiuser detection in space-time block coded MIMO system.
应用推荐