Sciweavers

51 search results - page 1 / 11
» P systems without multiplicities of symbol-objects
Sort
View
COCOON
2005
Springer
14 years 4 months ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...
IPL
2006
117views more  IPL 2006»
13 years 10 months ago
P systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
Artiom Alhazov
P2P
2006
IEEE
121views Communications» more  P2P 2006»
14 years 4 months ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips
P2P
2007
IEEE
139views Communications» more  P2P 2007»
14 years 5 months ago
A Trust-Based Exchange Framework for Multiple Services in P2P Systems
In this paper we propose fully distributed trustbased policies for p2p systems to regulate the exchange of different type of services and discourage misbehaviour. In a system of p...
Anna Satsiou, Leandros Tassiulas
CONEXT
2008
ACM
14 years 18 days ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda