Sciweavers

366 search results - page 53 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
CLIMA
2004
13 years 8 months ago
A New Framework for Knowledge Revision of Abductive Agents Through Their Interaction
The aim of this work is the design of a framework for the revision of knowledge in abductive reasoning agents, based on interaction. We address issues such as: how to exploit knowl...
Andrea Bracciali, Paolo Torroni
CSE
2009
IEEE
14 years 2 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
IAT
2007
IEEE
14 years 1 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
AIPS
2008
13 years 9 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
ATAL
2005
Springer
13 years 9 months ago
Agent-based matchmaking of mathematical web services
Service discovery and matchmaking in a distributed environment has been an active research issue since at least the mid 1990s. Previous work on matchmaking has typically presented...
Simone A. Ludwig, Omer F. Rana, William Naylor, Ju...