Approximate solutions for partially observable stochastic games with common payoffs
R Emery-Montemerlo, G Gordon… - Proceedings of the …, 2004 - ieeexplore.ieee.org
Partially observable decentralized decision making in robot teams is fundamentally different
from decision making in fully observable problems. Team members cannot simply apply …
from decision making in fully observable problems. Team members cannot simply apply …
A multiagent swarming system for distributed automatic target recognition using unmanned aerial vehicles
P Dasgupta - IEEE Transactions on Systems, Man, and …, 2008 - ieeexplore.ieee.org
Over the past few years, automatic target recognition (ATR) has emerged as an essential
image analysis tool to identify objects from temporally and spatially disjoint possibly noisy …
image analysis tool to identify objects from temporally and spatially disjoint possibly noisy …
Highly intensive data dissemination in complex networks
G D'Angelo, S Ferretti - Journal of Parallel and Distributed Computing, 2017 - Elsevier
This paper presents a study on data dissemination in unstructured Peer-to-Peer (P2P)
network overlays. The absence of a structure in unstructured overlays eases the network …
network overlays. The absence of a structure in unstructured overlays eases the network …
Agent-based buddy-finding methodology for knowledge sharing
X Li, AR Montazemi, Y Yuan - Information & Management, 2006 - Elsevier
The Internet provides an opportunity for knowledge sharing among people with similar
interests (ie, buddies). Emails, mailing lists, chat rooms, electronic bulletin boards …
interests (ie, buddies). Emails, mailing lists, chat rooms, electronic bulletin boards …
Implementing aggregation and broadcast over distributed hash tables
J Li, K Sollins, DY Lim - ACM SIGCOMM Computer Communication …, 2005 - dl.acm.org
Peer-to-peer (P2P) networks represent an effective way to share information, since there are
no central points of failure or bottleneck. However, the flip side to the distributive nature of …
no central points of failure or bottleneck. However, the flip side to the distributive nature of …
System and method for multi-level guided node and topology discovery
S Sridhar, S Naik, TO Pylant, M Rieser… - US Patent …, 2011 - Google Patents
2008-07-25 Assigned to SBC KNOWLEDGE VENTURES, LP reassignment SBC
KNOWLEDGE VENTURES, LP ASSIGNMENT OF ASSIGNORS INTEREST (SEE …
KNOWLEDGE VENTURES, LP ASSIGNMENT OF ASSIGNORS INTEREST (SEE …
Improving peer-to-peer resource discovery using mobile agent based referrals
P Dasgupta - Agents and Peer-to-Peer Computing: Second …, 2005 - Springer
A peer-to-peer (P2P) system consists of a decentralized, distributed network of nodes that is
capable of sharing resources and services without centralized supervision. A major …
capable of sharing resources and services without centralized supervision. A major …
Efficient broadcast in P2P Grids
P Merz, K Gorunova - … on Cluster Computing and the Grid …, 2005 - ieeexplore.ieee.org
In this paper, we present an efficient algorithm for performing a broadcast operation in P2P
grids. Our approach combines the advantages of two overlay architectures: Chord-like …
grids. Our approach combines the advantages of two overlay architectures: Chord-like …
Fault-tolerant resource discovery in peer-to-peer grids
P Merz, K Gorunova - Journal of grid Computing, 2007 - Springer
Peer-to-peer overlay technologies offer several advantages over centralized solutions to
managing desktop Grids. We present a new hybrid approach to resource discovery in P2P …
managing desktop Grids. We present a new hybrid approach to resource discovery in P2P …
MuON: Epidemic based mutual anonymity
N Bansod, A Malgi, BK Choi… - 13TH IEEE International …, 2005 - ieeexplore.ieee.org
A mutually anonymous service hides the identity of a client from the service provider and
vice-versa. Providing mutual anonymity usually requires a large number of participants …
vice-versa. Providing mutual anonymity usually requires a large number of participants …