Sciweavers

3379 search results - page 94 / 676
» Powers of Two
Sort
View
ECCC
2000
158views more  ECCC 2000»
15 years 3 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
TC
2002
15 years 3 months ago
Dynamic Power Management for Nonstationary Service Requests
Dynamic Power Management (DPM) is a design methodology aiming at reducing power consumption of electronic systems by performing selective shutdown of idle system resources. The eff...
Eui-Young Chung, Luca Benini, Alessandro Bogliolo,...
JCT
2011
90views more  JCT 2011»
14 years 11 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
134
Voted
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 1 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel
DAC
2005
ACM
16 years 5 months ago
An effective power mode transition technique in MTCMOS circuits
- The large magnitude of supply/ground bounces, which arise from power mode transitions in power gating structures, may cause spurious transitions in a circuit. This can result in ...
Afshin Abdollahi, Farzan Fallah, Massoud Pedram