6 search results - page 1 / 2 » Stably computable predicates are semilinear |
PODC
2006
ACM
13 years 10 months ago
2006
ACM
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
DCOSS
2005
Springer
13 years 10 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...