Sciweavers

366 search results - page 60 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
ATAL
2004
Springer
14 years 24 days ago
Towards a Formalization of Teamwork with Resource Constraints
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
Praveen Paruchuri, Milind Tambe, Fernando Ord&oacu...
FLAIRS
2004
13 years 8 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
IJAR
2008
114views more  IJAR 2008»
13 years 7 months ago
A definition of subjective possibility
: Based on the setting of exchangeable bets, this paper proposes a subjectivist view of numerical possibility theory. It relies on the assumption that when an agent constructs a pr...
Didier Dubois, Henri Prade, Philippe Smets
AAAI
2007
13 years 9 months ago
Logical Generative Models for Probabilistic Reasoning about Existence, Roles and Identity
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
David Poole
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 1 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens