83 search results - page 11 / 17 » On the Correctness of a Transaction Model for Mobile Computi... |
STOC
2010
ACM
14 years 10 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
ERSHOV
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
FCSC
2008
13 years 7 months ago
2008
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
OPODIS
2007
13 years 9 months ago
2007
We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
USITS
1997
13 years 8 months ago
1997
Emerging applications in electronic commerce often involve very low-cost transactions, which execute in the context of ongoing, extended clientserver relationships. For example, c...