Sciweavers

366 search results - page 6 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
MAAMAW
1994
Springer
13 years 11 months ago
Towards a Theory of Cooperative Problem Solving
One objective of distributed artificial intelligence research is to build systems that are capable of cooperative problem solving. To this end, a number of implementation-oriented ...
Michael Wooldridge, Nicholas R. Jennings
IJCAI
2007
13 years 8 months ago
On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
Evan Sultanik, Pragnesh Jay Modi, William C. Regli
EAAI
2008
104views more  EAAI 2008»
13 years 7 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
FLAIRS
2004
13 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
AAAI
2006
13 years 8 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama