Randomization in Constraint Satisfaction Problems

Article View: comp.ai

Article #9242

#9242

From: Philip W. L. Fong
Date: Fri, 03 Apr 1992 21:08

14 lines
1427 bytes

I am investigating the possibility of using randomized algorithm to
solve Constraint Satisfaction Problems.  If anyone out there know what
has been done in the past with this approach, please let me know.  I
am also interested in the application of Genetic Algorithm in solving
CSP.  (Actually I know nothing about GA and whether it can be applied to
solving CSP.)

The only thing that I know is that Brassard and Bratley used a Las Vegas
algorithm to solve the 8-Queens problem (in 'Algorithmics: Theory & Practice').

I would be grateful if I can receive input about this topic.  My email
address is wlfong@logos.waterloo.edu.

Philip Fong

Technical Details

Message-ID: <1992Apr3.210841.14999@watdragon.waterloo.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!utgpu!watserv1!watdragon!logos.waterloo.edu!wlfong

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103d82,5c298a9deef0de92,start
X-Google-Attributes: gid103d82,public
X-Google-Thread: 10461e,5c298a9deef0de92,start
X-Google-Attributes: gid10461e,public
X-Google-ArrivalTime: 1992-04-03 13:08:41 PST
Newsgroups: comp.ai,can.ai
Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!utgpu!watserv1!watdragon!logos.waterloo.edu!wlfong
From: wlfong@logos.waterloo.edu (Philip W. L. Fong)
Subject: Randomization in Constraint Satisfaction Problems
Message-ID: <1992Apr3.210841.14999@watdragon.waterloo.edu>
Keywords: Randomization, Genetic Algorithms, Constraint Satisfaction Problems
Sender: news@watdragon.waterloo.edu (USENET News System)
Organization: University of Waterloo
Date: Fri, 3 Apr 1992 21:08:41 GMT
Lines: 15