Distributed Search Academic Article uri icon

abstract

  • Distributed constraint satisfaction problems (DisCSPs) are composed of agents, each holding its local constraints network, that are connected by constraints among variables of different agents. Agents assign values to variables, attempting to generate a locally consistent assignment that is also consistent with all constraints between agents (cf.[57, 61, 64]). To achieve this goal, agents check the value assignments to their variables for local consistency and exchange messages with other agents to check the consistency of their …

publication date

  • January 1, 2008