Sciweavers

4218 search results - page 367 / 844
» Complete sets of cooperations
Sort
View
ENTCS
2007
103views more  ENTCS 2007»
15 years 7 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott
FGCS
2007
125views more  FGCS 2007»
15 years 7 months ago
An autonomic tool for building self-organizing Grid-enabled applications
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
Gianluigi Folino, Giandomenico Spezzano
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
RAS
2006
134views more  RAS 2006»
15 years 7 months ago
Simultaneous planning, localization, and mapping in a camera sensor network
In this paper we examine issues of localization, exploration, and planning in the context of a hybrid robot/camera-network system. We exploit the ubiquity of camera networks to us...
Ioannis M. Rekleitis, David Meger, Gregory Dudek
TCOM
2008
117views more  TCOM 2008»
15 years 7 months ago
Distributed differential space-time coding for wireless relay networks
Distributed space-time coding is a cooperative transmission scheme proposed for wireless relay networks. With this scheme, antennas of the distributive relays work as transmit ante...
Yindi Jing, Hamid Jafarkhani