Sciweavers

830 search results - page 9 / 166
» Approximation power of directionlets
Sort
View
ADHOCNOW
2004
Springer
14 years 28 days ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
ADCM
2010
62views more  ADCM 2010»
13 years 7 months ago
Two condensed macro-elements with full approximation power
A variant of the classical C1 Powell-Sabin-12 macro-element is defined that has the same approximation power, but has fewer degrees of freedom and only requires vertex data. The sa...
Peter Alfeld, Larry L. Schumaker, Tatyana Sorokina
ADHOCNOW
2008
Springer
14 years 1 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
DAC
2009
ACM
13 years 11 months ago
Fast vectorless power grid verification using an approximate inverse technique
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
Nahi H. Abdul Ghani, Farid N. Najm
ATAL
2008
Springer
13 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...