By Topic

Empirical evaluation of distributed maximal constraint satisfaction method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Ando ; Dept. of Electr., Electron. & Information Eng., Kanagawa Univ., Japan ; M. Noto ; H. Toyoshima

A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. In this paper, we focus on an important subclass of distributed partial CSP called the distributed maximal CSP that can be applied to more practical kinds of problems. Specifically, we propose a method of solving distributed maximal CSPs using a combination of approximate and exact algorithms that yields faster optimal solutions than otherwise possible using conventional methods. Experimental results are presented that demonstrate the effectiveness of the proposed new approach.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:5 )

Date of Conference:

5-8 Oct. 2003