Sciweavers

1017 search results - page 1 / 204
» On the Power of k -Consistency
Sort
View
ADHOCNOW
2008
Springer
13 years 11 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
ISLPED
1997
ACM
130views Hardware» more  ISLPED 1997»
13 years 8 months ago
K2: an estimator for peak sustainable power of VLSI circuits
New measures of peak power in the context of sequential circuits are proposed. This paper presents an automatic procedure to obtain very good lower bounds on these measures as wel...
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. P...
ISCAS
2005
IEEE
106views Hardware» more  ISCAS 2005»
13 years 10 months ago
kT/C constrained optimization of power in pipeline ADCs
—This paper presents a method to optimize the power consumption of a pipelined ADC with kT/C noise constraint. The total power dependence on capacitor scaling and stage resolutio...
Yu Lin, Vipul Katyal, Mark Schlarmann, Randall L. ...
COCOON
2005
Springer
13 years 10 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
ISVLSI
2003
IEEE
99views VLSI» more  ISVLSI 2003»
13 years 10 months ago
Fast and Precise Power Prediction for Combinational Circuits
Hongping Li, John K. Antonio, Sudarshan K. Dhall