Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Abstract—We had previously proposed an outstanding evolutionary method, Automatically Defined Groups (ADG), for generating heterogeneous cooperative agents, and then we had deve...
Abstract. In this work, we are interested in understanding how emotional interactions with a social partner can bootstrap increasingly complex behaviors such as social referencing....
Sofiane Boucenna, Philippe Gaussier, Laurence Hafe...
— A room is a simple polygon with a prespecified point, called the door, on its boundary. Search starts at the door, and must detect any intruder that may be in the room, while ...