3143 search results - page 32 / 629 » Minimization of entropy functionals |
DAM
2008
14 years 12 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
DAC
2003
ACM
16 years 25 days ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
WCE
2007
15 years 1 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
VLSID
1996
IEEE
15 years 4 months ago
1996
IEEE
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
IPCO
2001
15 years 1 months ago
2001
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...