Sciweavers

2607 search results - page 160 / 522
» Complete Functional Synthesis
Sort
View
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 23 days ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
ICALP
2009
Springer
16 years 4 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
CCGRID
2006
IEEE
15 years 10 months ago
Towards Soft Real-Time Applications on Enterprise Desktop Grids
— Desktop grids use the idle cycles of desktop PC’s to provide huge computational power at low cost. However, because the underlying desktop computing resources are volatile, a...
Derrick Kondo, Bruno Kindarji, Gilles Fedak, Franc...
AAAI
2008
15 years 6 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
DAC
2008
ACM
16 years 4 months ago
An 8x8 run-time reconfigurable FPGA embedded in a SoC
This paper presents a RTR FPGA embedded in a System on Chip fabricated in 130nm CMOS process. Various aspects of the design flow, from automation to floor-planning are discussed. ...
Sumanta Chaudhuri, Sylvain Guilley, Florent Flamen...