Sciweavers

963 search results - page 128 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
14 years 9 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
SENSYS
2009
ACM
15 years 4 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
ICNP
2006
IEEE
15 years 3 months ago
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
— The BitTorrent (BT) file sharing protocol is popular due to its scalability property and the incentive mechanism to reduce free-riding. However, in designing such P2P file sh...
Bin Fan, Dah-Ming Chiu, John C. S. Lui
PODS
2009
ACM
112views Database» more  PODS 2009»
15 years 10 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...