Sciweavers

199 search results - page 9 / 40
» On some Algorithmic Problems for Groups and Monoids
Sort
View
HPCC
2007
Springer
14 years 1 months ago
Multi-domain Topology-Aware Grouping for Application-Layer Multicast
Application-layer multicast (ALM) can solve most of the problems of IP-based multicast. Topology-aware approach of ALM is more attractive because it exploits underlying network top...
Jianqun Cui, Yanxiang He, Libing Wu, Naixue Xiong,...
CCS
2007
ACM
14 years 1 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
ATAL
2006
Springer
13 years 11 months ago
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
IAT
2007
IEEE
14 years 1 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
INFOCOM
2006
IEEE
14 years 1 months ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...