Thumbnail
Access Restriction
Subscribed

Author Freuder, Eugene C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Relaxation ♦ Combinatorial algorithms ♦ Graph coloring ♦ Network consistency ♦ Search ♦ Constraint satisfaction ♦ Backtrack ♦ Constraint networks ♦ Scene labeling
Abstract A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which is related to problems of backtrack tree search efficiency. An algorithm is developed that can achieve any level of consistency desired, in order to preprocess the problem for subsequent backtrack search, or to function as an alternative to backtrack search by explicitly determining all solutions.
Description Affiliation: Univ. of New Hampshire, Durham, NH (Freuder, Eugene C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 11
Page Count 9
Starting Page 958
Ending Page 966


Open content in new tab

   Open content in new tab
Source: ACM Digital Library