Sciweavers

1022 search results - page 153 / 205
» Logspace Complexity of Functions and Structures
Sort
View
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
14 years 7 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
14 years 7 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 7 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
CSR
2009
Springer
14 years 4 months ago
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
Maurice J. Jansen, B. V. Raghavendra Rao
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz