8. Constraints: Search, Domain Reduction

Share it with your friends Like

Thanks! Share it with your friends!

Close

MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course: http://ocw.mit.edu/6-034F10
Instructor: Patrick Winston

This lecture covers map coloring and related scheduling problems. We develop pseudocode for the domain reduction algorithm and consider how much constraint propagation is most efficient, and whether to start with the most or least constrained variables.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Comments

ChopinFlutist says:

How annoying is the person sleeping. Every lesson he/she is disrespectful in so many ways.

Joe Bowman says:

Seriously if you keep up with the lectures they just get better and better. I can feel my brain beating. 😀

Lucky says:

the number of students decreased significantly after line drawing lecture lol

Kuang Huang says:

why these students late for this awesome class?

Noah Crowley says:

Being a former Arizonan, hearing him mistake New Mexico for the Grand Canyon State was painful.

Scott Grodberg says:

I love these. This prof. is succinct and good examples

12345a says:

17:55 the guy with the red jacked on the end of the 2nd row is sound asleep like a baby XD XD
Dude , why sit on the 2nd row???

Anzal Khan says:

What do we check when we consider assignments ?

Parker Neufeld says:

Or we'll let this program give the class seizures. at 1:30

Alex Yu says:

Why don't we use binary search to find # planes…

dothemathright 1111 says:

Anyone have a link to the exam method of managing constraint propagation that is mentioned in the video?

Samarpan rai says:

anyone knows the link for the simulation he runs at the beginning of the lecture?

OzgurBagci says:

why does he use only capital letters? this slows him down.

Raymond Pang says:

why do not just arrange the flights in order and check the maximum number of overlapping flights at a time to get the minimum amount of required plane?

Al Gebra says:

I tried to test the demonstrations.jnlp file at home using javaws under Linux (Debian stretch). It seems that I have some permission problems. I get f.e. the following line in the terminal:
java.security.AccessControlException: access denied ("java.io.FilePermission" "/usr/bin/xprop" "execute")
Has anybody a suggestion to cure this?

Al Gebra says:

What a brilliant lecture series …

Tyler Matthew Harris says:

This is so awesome

Proto says:

Does anyone know what it says between propagation options and resource planning? It looks kinda like ORERING EFFECTS, so I'm guessing it says ordering effects. It would be helpful if someone can identify it.

Richard Walker says:

I'm pretty sure that every time he said "Arizona," he meant to say "New Mexico."

supernewuser says:

I have to be honest, the 'Assignmet' typo was grating on me.

Bert Verhelst says:

since the values are discrete, couldn't it be that the minimum amount of planes needed is 5. And 3 and 4 are both on the impossible side of the time-to-calculate bulge?

aklawy2008 says:

Why is the Domain (D) a bag of values rather than a set of values?

kyoungd says:

Learn about color mapping and resource allocation manager.  Surprisingly they are same problem.  Nice.  😀

Plugtree says:

Martial Arts in #AI. Some #AIkido for constraints. Use your enemies powers against him. #LearnAIforFun

Write a comment

*

Area 51
Ringing

Answer