242 search results - page 8 / 49 » Distributed algorithms with dynamical random transitions |
121
click to vote
CP
1999
Springer
15 years 3 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
103
click to vote
NOSSDAV
2009
Springer
15 years 6 months ago
2009
Springer
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
HCW
1998
IEEE
15 years 3 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...