Sciweavers

1205 search results - page 44 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Improving cooperation in peer-to-peer systems using social networks
Rational and selfish nodes in P2P systems usually lack effective incentives to cooperate, contributing to the increase of free-riders, and degrading the system performance. Variou...
Wenyu Wang, Li Zhao, Ruixi Yuan
CORR
2006
Springer
77views Education» more  CORR 2006»
13 years 7 months ago
Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
Wei Dai, Youjian Liu, Brian Rider
IPPS
2008
IEEE
14 years 2 months ago
The design of a versatile, secure P2PSIP communications architecture for the public internet
Communications systems, encompassing VoIP, IM, and other personal media, present different challenges for P2P environments than other P2P applications. In particular, reliable com...
David A. Bryan, Bruce Lowekamp, Marcia Zangrilli
ICPADS
2006
IEEE
14 years 1 months ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
PPL
2007
86views more  PPL 2007»
13 years 7 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....