Sciweavers

1205 search results - page 27 / 241
» On P Systems with Bounded Parallelism
Sort
View
IWSOS
2009
Springer
14 years 2 months ago
Revisiting P2P Content Sharing in Wireless Ad Hoc Networks
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...
Mohamed Karim Sbai, Chadi Barakat
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 23 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ICDCS
2008
IEEE
14 years 2 months ago
On Cooperative Caching in Wireless P2P Networks
Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these stu...
Jing Zhao, Ping Zhang, Guohong Cao
ICPP
1998
IEEE
13 years 11 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
IPPS
2009
IEEE
14 years 2 months ago
BarterCast: A practical approach to prevent lazy freeriding in P2P networks
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...
Michel Meulpolder, Johan A. Pouwelse, Dick H. J. E...