您要查找的是不是:
- The structure and properties of monotone linear complementarity problems are studied. 讨论了单调线性互补问题解的结构及性质。
- A monotone linear variational inequality (LVI) is acquired from the smooth problem and it may be solved by a projection-contraction (PC) method. 在定位过程中,将非光滑约束韦伯问题转化为优化问题,再将之化为单调线性变分不等式,进而通过投影-收缩方法;
- Which uses a linear search algorithm to find entries in the list of delegates. 类型,它使用线性搜索算法在委托列表中查找项。
- Because template group collections typically are small, the performance of the linear search operation is not critical. 因为模板组集合通常很小,所以线性搜索操作的性能无关紧要。
- This class uses a linear search algorithm to find entries in the list of delegates. 该类使用线性搜索算法在委托列表中查找项。
- A linear search algorithm is inefficient when working with a large number of entries. 线性搜索算法在处理大量项时是低效的。
- Internally, a linear search using slot comparison is performed and the slot, if found, is removed from the list. 在内部,将利用插槽比较,执行一个线性搜索,如果找到该插槽,就从链表中删除。
- centering monotone linear complementarity problems 内点算法
- In fact, in the final analysis, a simple linear search through an array might actually be faster (depending on the circumstances). 事实上,在最后的分析中,通过数组的简单线性搜索实际上可能更快(取决于具体的情况)。
- monotone linear complementarity problems 单调线性互补
- The great deal of circulating gas and the strongly turbulent flow in the circle passage are the main factors causing the hoop pressure distribution varied in non monotonic way. 环形通道内存在大量循环气流和强烈湍动,切向速度分量远大于径向速度分量,导致周向压强分布的非单调变化。
- Because template region collections are typically small, the performance of the linear search operation is not critical. 因为模板区域集合通常很小,所以线性搜索操作的性能无关紧要。
- For each event dispatch, one virtual call is followed by a linear search for the appropriate reaction, using one RTTI comparison per reaction. 对于每一个事件分派,将有一次虚拟函数调用加一个对合适反应的线性查找,每个反应使用一个RTTI比较。
- A linear search through a small array can be faster than a binary search through a data structure with a lot of pointers that causes page faults or cache misses. 如果二进制搜索通过的数据结构具有许多导致页错误或缓存未命中的指针,则通过小数组的线性搜索可以比二进制搜索快。
- However, linear search strategies usually bring computational burden.To overcome this problem, Sun and Zhang introduced conjugate gradient methods without linear search. 然而,线搜索技巧往往会增加计算的复杂度,为了克服这个缺点,孙捷和张家普又提出了一种叫做不带线搜索的共轭梯度方法。
- This non sequitur invalidates his argument. 他不根据前提推理因而论证无效。
- We employan approximated linear search procedure based on the Fletcher exact penalty functionand the use of approximated derivetives of the multiplier function that avoids the needto evaluate the second order derivatives of the problem functions . 并利用Fletcher精确罚函数的近似函数作为线性搜索函数,以避免计算二阶导数。
- For curves with few feature points, we divide each curve into several curve segments according to curvature maxima and make use of a local linear search algorithm find the partial matches. 对于特征点较少的曲线,根据曲率极值点将曲线划分为多条曲线段,采用局部线性搜索法实现曲线的部分匹配。
- Patience is a sine qua non for a good teacher. 做个优秀教师必不可少的条件是要有耐心。
- At each iteration, the proposed subproblem consists of a strongly monotonic linear variational inequality and a well-conditioned system of nonlinear equations, which is easily to be solved. 在每步迭代计算中,新方法提出了易于计算的子问题,该子问题由强单调的线性变分不等式和良态的非线性方程系统构成。