Sciweavers

197 search results - page 10 / 40
» Circuits, Pebbling and Expressibility
Sort
View
LATA
2010
Springer
13 years 11 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 1 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ISPD
2003
ACM
133views Hardware» more  ISPD 2003»
14 years 22 days ago
Closed form expressions for extending step delay and slew metrics to ramp inputs
: Recent years have seen significant research in finding closed form expressions for the delay of an RC circuit that improves upon the Elmore delay model. However, several of these...
Chandramouli V. Kashyap, Charles J. Alpert, Frank ...
ASPDAC
2000
ACM
99views Hardware» more  ASPDAC 2000»
13 years 12 months ago
Analysis of power-clocked CMOS with application to the design of energy-recovery circuits
⎯ This paper presents our research results on power-clocked CMOS design. First we provide algebraic expressions and describe properties of clocked signals. Next two types of powe...
Massoud Pedram, Xunwei Wu
ENTCS
2008
70views more  ENTCS 2008»
13 years 7 months ago
Spatial Differentiation and Positive Circuits in a Discrete Framework
Abstract. The biologist R. Thomas has enounced a rule relating multistationnarity in a system of genes interacting in a single cell to the existence of a positive circuit in the re...
Anne Crumière, Paul Ruet