Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Asynchronous Partial Overlay: A New Algorithm for Solving Distributed
  Constraint Satisfaction Problems   Distributed Constraint Satisfaction (DCSP) has long been considered an
important problem in multi-agent systems research. This is because many
real-world problems can be represented as constraint satisfaction and these
problems often present themselves in a distributed form. In this article, we
present a new complete, distributed algorithm called Asynchronous Partial
Overlay (APO) for solving DCSPs that is based on a cooperative mediation
process. The primary ideas behind this algorithm are that agents, when acting
as a mediator, centralize small, relevant portions of the DCSP, that these
centralized subproblems overlap, and that agents increase the size of their
subproblems along critical paths within the DCSP as the problem solving
unfolds. We present empirical evidence that shows that APO outperforms other
known, complete DCSP techniques.

8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
27
The categories of this paper are: comp-gas