1186 search results - page 71 / 238 » State machine models of timing and circuit design |
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, an energy-efficient and high performance ternary content addressable memory (TCAM) are presented. It employs the concept of “green” microarchitecture and circ...
108
click to vote
CCGRID
2010
IEEE
14 years 1 months ago
2010
IEEE
- Scientific workflows have become an integral part of cyberinfrastructure as their computational complexity and data sizes have grown. However, the complexity of the distributed i...
112
click to vote
DATE
1999
IEEE
15 years 2 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
83
Voted
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...