Sciweavers

704 search results - page 69 / 141
» On-chip logic minimization
Sort
View
LPAR
2004
Springer
15 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
CORR
2006
Springer
124views Education» more  CORR 2006»
14 years 10 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...
ICASSP
2010
IEEE
14 years 10 months ago
Optimize the obvious: Automatic call flow generation
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
David Suendermann, Jackson Liscombe, Roberto Piera...
GLVLSI
2005
IEEE
122views VLSI» more  GLVLSI 2005»
15 years 3 months ago
PIM lite: a multithreaded processor-in-memory prototype
Abstract— PIM Lite is a processor-in-memory prototype implemented in a 0.18 micron logic process. PIM Lite provides a complete working demonstration of a minimal-state, lightweig...
Shyamkumar Thoziyoor, Jay B. Brockman, Daniel Rinz...
LCC
1994
200views Algorithms» more  LCC 1994»
15 years 2 months ago
Program Extraction from Classical Proofs
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
Ulrich Berger, Helmut Schwichtenberg