1403 search results - page 116 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
103
click to vote
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
A key constraint in mobile communications is the reliance on a battery with a limited energy supply. Efficiently utilizing the available energy is therefore an important design co...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...