Sciweavers

1795 search results - page 34 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 1 months ago
Solving large-scale linear circuit problems via convex optimization
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...
DAC
1994
ACM
14 years 23 days ago
A Modular Partitioning Approach for Asynchronous Circuit Synthesis
Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an ecient modular partitioning approach for asynchronous c...
Ruchir Puri, Jun Gu
ISCAS
2008
IEEE
103views Hardware» more  ISCAS 2008»
14 years 3 months ago
A novel multiscroll chaotic system and its realization
Abstract— This paper proposes a novel multiscroll chaotic system, which is different from Chua’s circuit and all its variants in most aspects of the algebraic form, circuit des...
Simin Yu, Jinhu Lu, Guanrong Chen
ASPDAC
2001
ACM
81views Hardware» more  ASPDAC 2001»
14 years 9 days ago
High-level specification and efficient implementation of pipelined circuits
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
Maria-Cristina V. Marinescu, Martin C. Rinard
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
14 years 12 days ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira