1205 search results - page 3 / 241 » On P Systems with Bounded Parallelism |
HPDC
2003
IEEE
13 years 10 months ago
2003
IEEE
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
P2P
2007
IEEE
13 years 11 months ago
2007
IEEE
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
DNA
2007
Springer
13 years 11 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE