Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems

    The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multi-agent systems. To deal with realistic problems, multiple local variables may be ...

    Lingzhong Zhou, John Thornton, Abdul Sattar in AI 2003: Advances in Artificial Intelligence (2003)

  2. No Access

    Chapter and Conference Paper

    Handling Over-Constrained Problems in Distributed Multi-agent Systems

    The distributed constraint satisfaction problem is a general framework used to represent problems in distributed multi-agent systems. In this paper, we describe a detailed investigation of handling over-constr...

    Lingzhong Zhou, Abdul Sattar, Scott Goodwin in Advances in Artificial Intelligence (2005)