Sciweavers

284 search results - page 16 / 57
» Distributed Agreement with Optimal Communication Complexity
Sort
View
NOMS
2002
IEEE
15 years 4 months ago
Message tracking in SOAP-based Web services
As web services become more prevalent, the nature of electronic transactions on the Internet changes from simple browser-to-business clicks to an orchestrated flow of messages bet...
Akhil Sahai, Vijay Machiraju, Jinsong Ouyang, Klau...
118
Voted
TDSC
2011
14 years 6 months ago
RITAS: Services for Randomized Intrusion Tolerance
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 6 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber
IPPS
2000
IEEE
15 years 4 months ago
Image Layer Decomposition for Distributed Real-Time Rendering on Clusters
We propose a novel work partitioning technique, Image Layer Decomposition (ILD), designed specifically to support distributed real-time rendering on commodity clusters. ILD has s...
Thu D. Nguyen, John Zahorjan
ATAL
2003
Springer
15 years 4 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein