Sciweavers

1763 search results - page 334 / 353
» Dependent random choice
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
ATAL
2009
Springer
14 years 2 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
DAMON
2009
Springer
14 years 2 months ago
Evaluating and repairing write performance on flash devices
In the last few years NAND flash storage has become more and more popular as price per GB and capacity both improve at exponential rates. Flash memory offers significant bene...
Radu Stoica, Manos Athanassoulis, Ryan Johnson, An...
ICC
2008
IEEE
128views Communications» more  ICC 2008»
14 years 2 months ago
Experimental Analysis of Super-Seeding in BitTorrent
—With the popularity of BitTorrent, improving its performance has been an active research area. Super-seeding, a special upload policy for initial seeds, improves the efficiency ...
Zhijia Chen, Yang Chen, Chuang Lin, Vaibhav Nivarg...