Sciweavers

7992 search results - page 236 / 1599
» Communication Abstractions for Distributed Systems
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 23 days ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
IAT
2008
IEEE
15 years 9 months ago
Introducing Communication in Dis-POMDPs with Locality of Interaction
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Y...
EDO
2006
Springer
15 years 6 months ago
Damon: a decentralized aspect middleware built on top of a peer-to-peer overlay network
In this paper we present Damon, a decentralized wide-area runtime aspect middleware built on top of a structured peer-topeer (p2p) substrate and a dynamic Aspect Oriented Programm...
Rubén Mondéjar, Pedro García ...
CASCON
1996
99views Education» more  CASCON 1996»
15 years 3 months ago
Modeling and analysis of the Unix communication subsystems
The performance of host communication subsystems is an important research topic in computer networks.1 Performance metrics such as throughput, delay, and packet loss are important...
Yi-Chun Chu, Toby J. Teorey
CIA
2004
Springer
15 years 7 months ago
Reasoning About Communication - A Practical Approach Based on Empirical Semantics
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
Felix A. Fischer, Michael Rovatsos