Sciweavers

356 search results - page 37 / 72
» Parallelizing time with polynomial circuits
Sort
View
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
14 years 12 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
GLVLSI
2011
IEEE
344views VLSI» more  GLVLSI 2011»
14 years 3 months ago
Circuit design of a dual-versioning L1 data cache for optimistic concurrency
This paper proposes a novel L1 data cache design with dualversioning SRAM cells (dvSRAM) for chip multi-processors (CMP) that implement optimistic concurrency proposals. In this n...
Azam Seyedi, Adrià Armejach, Adrián ...
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
15 years 4 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
CONCUR
2009
Springer
15 years 6 months ago
Measuring Permissivity in Finite Games
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
Patricia Bouyer, Marie Duflot, Nicolas Markey, Gab...
CC
2010
Springer
135views System Software» more  CC 2010»
14 years 12 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner