Constraint Satisfaction Problem
Constraint-satisfaction problems
or
CSP
s are
mathematical
problems where one must find states or objects in a system that satisfy a number of
constraints
or criteria. CSPs are the subject of intense research in both
artificial intelligence
and
operations research
. Many CSPs require a combination of
heuristics
and
combinatorial search
methods to solve in a reasonable time. Examples of constraint-satisfaction problems:
Eight queens puzzle
Map-coloring problem
See also:
Declarative programming
Constraint programming
External links
One very good text on the subject is
Edward Tsang
's
Foundations of Constraint Satisfaction
.
<< Previous
Word Browser
Next >>
cuauhtmoc crdenas
gail russell
list of sweden related topics
hidden variable theory
biberach (district)
climax
rheingau taunus
fukui prefecture
closed london underground stations
vincent novello
australian raven
john nichol
lesser water boatman
johnnie taylor
thomas hill green
kazakh
richard lewis nettleship
chiang mai province
torresian crow
joan of acre
little crow
david starkey
william wycherley
intestinal parasite
catboat
giardia lamblia
elizabeth d'amorie
national institute of general medical sciences
lists of corporate assets
stephen i
bill buckner
aldwych tube station
list of shoe designers
ceremonial magic
crown prince rudolf of austria
apparatus for demonstrating osmosis
military industrial complex
megaphone
mohammad sadeq al sadr
japanese cruiser nachi
dhani harrison
japanese cruiser haguro
gnther schifter
japanese destroyer ikazuchi
Copyright 2005-2009 OnPedia.com. All Rights Reserved