对分枝定界和堆栈算法采用本文提出的排序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.
应用推荐