413 search results - page 37 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
127
click to vote
NETGAMES
2006
ACM
15 years 8 months ago
2006
ACM
This paper studies a way to improve consistency of states in a ball game typed DVE with lag, in P2P architecture. We also study how to control shared objects in real-time in a ser...
116
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
CP
2007
Springer
15 years 8 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
148
click to vote
BROADNETS
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
WDAG
2004
Springer
15 years 7 months ago
2004
Springer
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...