对分枝定界和堆栈算法采用本文提出的排序QR分解算法在检测前对信号排序。
The sorted QR decomposition algorithms proposed in this paper are used to sort signal in BB and stack algorithms.
事实上，如果跟踪该算法的过程，就会认识到它构建一个所有可能的堆栈配置以及在这些配置间的转换的列表。
In fact, if you were to trace this algorithm, you would realize that it builds a list of all the possible stack configurations and the transitions between them.
目前为止的示例（计数器和堆栈）都是非常简单的非阻塞算法，一旦掌握了在循环中使用CAS，就可以容易地模仿它们。
The examples so far -- counter and stack -- are very simple nonblocking algorithms and are easy to follow once you grasp the pattern of using CAS in a loop.
如果您记得每种状态表示一个堆栈配置，则理解算法的这一部分是较容易的。
It's easier to understand this portion of the algorithm if you remember that each state represent a certain stack configuration.
为了更好地理解该算法，可以将该转换图与堆栈相比较。
To better understand the algorithm, you might to compare this transition diagram with a stack.
这个调用实质上会执行同一个算法，但是是对于在这个AccessControlContext中封装的调用堆栈（属于客户机）执行。
This call leads to essentially the same algorithm being executed, but on the call stack encapsulated in this AccessControlContext (belonging to the client).
代码访问安全是一个基于堆栈的算法。
混合优化策略首先根据堆箱规则构造集装箱堆栈目标状态，然后运用改进广度优先算法搜索搬箱步骤。
The system builds firstly the objective state of the container stack on the principle and then searches for the steps of turning box using the non-conventional breadth-first search algorithm.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
A method to mark transitive predecessors and transitive successors by using depth first search is provided with a description of the algorithm based on stack.
有些算法本质上是递归的，为之编写非递归算法会非常冗长，而且最终也必须使用堆栈进行递归模拟。
Some algorithms are recursive in nature, trying to write non-recursive algorithms is tedious, and in the end they become recursive simulations that use stacks themselves!
该算法通过引入邻接矩阵并借助自定义的堆栈数据结构来完成控制流路径子集的生成。
The control flow paths in the subset are based on the strategy that the loop statements in the program execute less than twice.
算法的缺点是不适合实时疲劳损伤计算，且算法在实现时需要计算机为其堆栈分配较多的存储器空间。
The disadvantages of the algorithm are that it is not suitable for realtime application and that it requires the computer to assign a large amount of memory to stack in its implementation.
算法的缺点是不适合实时疲劳损伤计算，且算法在实现时需要计算机为其堆栈分配较多的存储器空间。
The disadvantages of the algorithm are that it is not suitable for realtime application and that it requires the computer to assign a large amount of memory to stack in its implementation.
应用推荐