Sciweavers

7 search results - page 1 / 2
» The computational power of membrane systems under tight unif...
Sort
View
NC
2011
201views Neural Networks» more  NC 2011»
12 years 11 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
MEMBRANE
2007
Springer
13 years 10 months ago
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
In this paper we introduce a variant of membrane systems with elementary division and without charges. We allow only elementary division where the resulting membranes are identical...
Niall Murphy, Damien Woods
SIROCCO
2008
13 years 5 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
CLUSTER
2002
IEEE
13 years 4 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer