Authors: Ilias Sakellariou; Ioannis Vlahavas

Source: Journal of Experimental & Theoretical Artificial Intelligence, Volume 16, Number 2, April-June 2004 , pp. 107-124(18)

Publisher: Taylor and Francis Ltd

Abstract:

Distributed constraint satisfaction has drawn much attention in the past years, with a number of algorithms proposed to tackle the problem. Research in the area has followed two directions: distributed search techniques and distributed filtering techniques. This paper presents a new distributed filtering algorithm, named Distributed Singleton Arc Consistency (Dis-SAC), which is based on the singleton consistency algorithm. Dis-SAC is a parallel, coarse-grain filtering algorithm aimed at improving the performance of singleton consistency by distributing the work to be done to a number of agents. The current paper presents the basic idea behind the algorithm and two versions of it that employ different communication policies along with experimental results obtained on a set of random binary CSP problems.

Keywords: distributed constraint satisfaction; singleton consistency

Document Type: Research article

DOI: http://dx.doi.org/10.1080/09528130410001724968

Publication date: 2004-04-01

More about this publication?

• Editorial Board
• Information for Authors
• Subscribe to this Title
• ingentaconnect is not responsible for the content or availability of external websites

Related content

• In this: publication
• By this: publisher
• In this Subject: Computer Science
• By this author: Ilias Sakellariou ;  Ioannis Vlahavas

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers