Sciweavers

580 search results - page 50 / 116
» Choosing a random peer
Sort
View
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
16 years 8 days ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme
KIVS
2005
Springer
15 years 11 months ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
ISVLSI
2008
IEEE
156views VLSI» more  ISVLSI 2008»
16 years 11 days ago
Cache Power Reduction in Presence of Within-Die Delay Variation Using Spare Ways
The share of leakage in cache power consumption increases with technology scaling. Choosing a higher threshold voltage (Vth) and/or gate-oxide thickness (Tox) for cache transistor...
Maziar Goudarzi, Tadayuki Matsumura, Tohru Ishihar...
ICASSP
2011
IEEE
14 years 9 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
FOCS
2002
IEEE
15 years 11 months ago
Load Balancing with Memory
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...