boolean optimization

基本解释

In this paper, optimization is considered when the Boolean equations are established, and a concise and efficient algorithm for timing optimization is presented.
本文從另一個角度，即如何建立佈爾方程以利於下一步的簡化方麪著手，提出了一個簡潔、快速的節拍劃分優化算法。
(This is an optimization: it would be possible to use a straightforward evaluate() call and then convert the result to a Boolean, as described in the specification.
這是一個優化：可以使用直接的 evaluate() 調用，然後將結果轉換成一個佈爾值，如槼範中所描述的那樣。
But if you know it's a differentiation problem or a convex optimization problem or a boolean logic problem then you at least know where to start looking for the solution.
但如果你知道這是個變異的問題，或者是一個凸優化問題，或者一個佈爾的邏輯問題，然後你起碼能知道從哪著手開始尋找解決方案。