Unbiased Statistics of a CSP - A Controlled-Bias Generator

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two aspects of the problem: defining a measure of complexity and generating random unbiased instances. For the first problem, we rely on a general framework and a measure of complexity we presented at CISSE08. For the generation problem, we restrict our analysis to the Sudoku example and we provide a solution that also explains why it is so difficult.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Unbiased Statistics of a CSP - A Controlled-Bias Generator does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unbiased Statistics of a CSP - A Controlled-Bias Generator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unbiased Statistics of a CSP - A Controlled-Bias Generator will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-349848

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.