377 search results - page 58 / 76 » Distributed computation under bit constraints |
97
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
With the increasing adoption of Java for parallel and distributed computing, there is a strong motivation for enhancing the expressive elegance of the RMI paradigm with flexible ...
118
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
116
Voted
ICTAI
2010
IEEE
14 years 10 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
117
Voted
PKC
2012
Springer
13 years 2 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...