Sciweavers

1656 search results - page 270 / 332
» Building Dependable Distributed Applications Using AQUA
Sort
View
110
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 6 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ATAL
2006
Springer
15 years 6 months ago
Adaptive agent negotiation via argumentation
In this paper, we study how argumentation can be used as a basis for negotiation between autonomous agents, where negotiation strategies of the different parties are represented a...
Antonis C. Kakas, Pavlos Moraitis
MAGS
2010
97views more  MAGS 2010»
15 years 1 months ago
Towards reliable multi-agent systems: An adaptive replication mechanism
Abstract. Distributed cooperative applications (e.g., e-commerce) are now increasingly being designed as a set of autonomous entities, named agents, which interact and coordinate (...
Zahia Guessoum, Jean-Pierre Briot, Nora Faci, Oliv...
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
14 years 5 months ago
No free lunch in data privacy
Differential privacy is a powerful tool for providing privacypreserving noisy query answers over statistical databases. It guarantees that the distribution of noisy query answers...
Daniel Kifer, Ashwin Machanavajjhala
RTAS
2008
IEEE
15 years 9 months ago
Schedulability Analysis of MSC-based System Models
Message Sequence Charts (MSCs) are widely used for describing interaction scenarios between the components of a distributed system. Consequently, worst-case response time estimati...
Lei Ju, Abhik Roychoudhury, Samarjit Chakraborty