Sciweavers

7195 search results - page 925 / 1439
» On Computing Power
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
16 years 9 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SLIP
2003
ACM
16 years 9 days ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
FOCS
2002
IEEE
16 years 16 hour ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
HPCA
2000
IEEE
15 years 11 months ago
Evaluation of Active Disks for Decision Support Databases
Growth and usage trends for large decision support databases indicate that there is a need for architectures that scale the processing power as the dataset grows. To meet this nee...
Mustafa Uysal, Anurag Acharya, Joel H. Saltz
EENERGY
2010
15 years 11 months ago
Mobile networks unplugged
Mobile network access has seemingly become ubiquitous in industrialized countries. With data services becoming sufficiently fast, usable, and affordable, demand is growing rapidly...
Jukka Manner, Marko Luoma, Jörg Ott, Jyri H&a...