A true b false exam a 3 solving a csp on a

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: alse Exam B: 2. The “least constraining value heurisDc” is a heurisDc to determine what value to choose (as opposed to which variable to choose). a) True, b) False Exam A: 3. Solving a CSP on a tree ­structured constraint graph has Dme complexity O(nd3) a) True, b) False Exam B: 3. Solving a CSP on a tree ­structured constraint graph has Dme complexity O(n2d3) a) True, b) False Exam A: 4. Local search techniques are not applicable CSPs because...
View Full Document

This note was uploaded on 01/21/2014 for the course COMPSCI 171 taught by Professor Welling during the Fall '10 term at UC Irvine.

Ask a homework question - tutors are online