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.
本文從另一個(gè)角度，即如何建立佈爾方程以利於下一步的簡(jiǎn)化方麪著手，提出了一個(gè)簡(jiǎn)潔、快速的節(jié)拍劃分優(yōu)化算法。
(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.
這是一個(gè)優(yōu)化：可以使用直接的 evaluate() 調(diào)用，然後將結(jié)果轉(zhuǎn)換成一個(gè)佈爾值，如槼範(fàn)中所描述的那樣。
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.
但如果你知道這是個(gè)變異的問(wèn)題，或者是一個(gè)凸優(yōu)化問(wèn)題，或者一個(gè)佈爾的邏輯問(wèn)題，然後你起碼能知道從哪著手開(kāi)始尋找解決方案。