Sciweavers

377 search results - page 58 / 76
» Distributed computation under bit constraints
Sort
View
IPPS
2003
IEEE
14 years 28 days ago
RMIX: A Multiprotocol RMI Framework for Java
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 ...
Dawid Kurzyniec, Tomasz Wrzosek, Vaidy S. Sunderam...
PODC
2011
ACM
12 years 10 months ago
Structuring unreliable radio networks
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...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
ATAL
2006
Springer
13 years 11 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ICTAI
2010
IEEE
13 years 5 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
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 ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 10 months ago
Better Bootstrapping in Fully Homomorphic Encryption
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...
Craig Gentry, Shai Halevi, Nigel P. Smart