542 research outputs found
Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks
consisting of very limited mobile agents with no control over their own
movement: A collection of anonymous agents, modeled by finite automata,
interact in pairs according to some rules.
Predicates on the initial configurations that can be computed by such
protocols have been characterized under several hypotheses.
We discuss here whether and when the rules of interactions between agents can
be seen as a game from game theory. We do so by discussing several basic
protocols
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
We prove new bounds on the quantum communication complexity of the
disjointness and equality problems. For the case of exact and non-deterministic
protocols we show that these complexities are all equal to n+1, the previous
best lower bound being n/2. We show this by improving a general bound for
non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^*
n})-qubit bounded-error protocol for disjointness, modifying and improving the
earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an
Omega(sqrt{n}) lower bound for a large class of protocols that includes the
BCW-protocol as well as our new protocol.Comment: 11 pages LaTe
On the Convergence of Population Protocols When Population Goes to Infinity
Population protocols have been introduced as a model of sensor networks
consisting of very limited mobile agents with no control over their own
movement. A population protocol corresponds to a collection of anonymous
agents, modeled by finite automata, that interact with one another to carry out
computations, by updating their states, using some rules. Their computational
power has been investigated under several hypotheses but always when restricted
to finite size populations. In particular, predicates stably computable in the
original model have been characterized as those definable in Presburger
arithmetic. We study mathematically the convergence of population protocols
when the size of the population goes to infinity. We do so by giving general
results, that we illustrate through the example of a particular population
protocol for which we even obtain an asymptotic development. This example shows
in particular that these protocols seem to have a rather different
computational power when a huge population hypothesis is considered.Comment: Submitted to Applied Mathematics and Computation. 200
- …