Sciweavers

1795 search results - page 61 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
LICS
2002
IEEE
14 years 1 months ago
Complete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
William Hesse, Neil Immerman
DAC
2000
ACM
14 years 9 months ago
MINFLOTRANSIT: min-cost flow based transistor sizing tool
This paper presents MINFLOTRANSIT, a new transistor sizing tool for fast sizing of combinational circuits with minimal cost. MINFLOTRANSIT is an iterative relaxation based tool th...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...
DATE
2003
IEEE
122views Hardware» more  DATE 2003»
14 years 2 months ago
Synthesis of Complex Control Structures from Behavioral SystemC Models
In this paper we present the results of a set of experiments we conducted in order to evaluate the viability of the behavioral synthesis, relying on the tools available at the mom...
Francesco Bruschi, Fabrizio Ferrandi
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
14 years 1 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
ICECCS
2005
IEEE
87views Hardware» more  ICECCS 2005»
14 years 2 months ago
Modeling Diverse and Complex Interactions Enabled by Middleware as Connectors in Software Architectures
Middleware enables distributed components to interact with each others in diverse and complex manners. Such interactions should be modeled at architecture level for controlling th...
Yali Zhu