Sciweavers

176 search results - page 23 / 36
» On Algebras with Iteration
Sort
View
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
14 years 4 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
STACS
2007
Springer
14 years 1 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
13 years 11 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
SIAMSC
2010
114views more  SIAMSC 2010»
13 years 6 months ago
Smoothed Aggregation Multigrid for Markov Chains
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 7 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal