Sciweavers

1440 search results - page 166 / 288
» Information sharing for distributed planning
Sort
View
EURONGI
2006
Springer
15 years 10 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
ATAL
2010
Springer
15 years 7 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
COLCOM
2007
IEEE
16 years 20 days ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri
DEBS
2010
ACM
15 years 9 months ago
Magnet: practical subscription clustering for Internet-scale publish/subscribe
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay netwo...
Sarunas Girdzijauskas, Gregory Chockler, Ymir Vigf...
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
Key Distillation and the Secret-Bit Fraction
We consider distillation of secret bits from partially secret noisy correlations PABE, shared between two honest parties and an eavesdropper. The most studied distillation scenario...
Nick S. Jones, Lluis Masanes