Sciweavers

597 search results - page 62 / 120
» Homomorphisms of random paths
Sort
View
TWC
2010
13 years 4 months ago
MIMO Broadcast Channels with Spatial Heterogeneity
We develop a realistic model for multiple-input multiple-output (MIMO) broadcast channels, where each randomly located user's average SNR depends on its distance from the tran...
Illsoo Sohn, Jeffrey G. Andrews, Kwang Bok Lee
INFOCOM
2011
IEEE
13 years 1 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
DEXA
2009
Springer
138views Database» more  DEXA 2009»
14 years 4 months ago
Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems
Recently, flash memory is emerging as the storage device. With price sliding fast, the cost per capacity is approaching to that of SATA disk drives. So far flash memory has been ...
Yongkun Wang, Kazuo Goda, Masaru Kitsuregawa
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
14 years 4 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...