theCEED.com - Research your Interests!!
  • MEMBERSHIP PROFILE
  • bar
  • No member information.
  • login_button
  • sign_up_button
no_image

MIT OpenCourse Ware : Machine Learning Course

About the ceed

Site address : http://web.mit.edu/

* This literary work will be deleted in case the original author requires.
Recommend : 22 I Total List : 22 I 2015-05-28
favorite
5. Search: Optimal, Branch and Bound, A* 2015.05.28 14:00:46
Nickname : 81. theceed Recommend : 1 View : 309 btn_recommend.png declaration

Please enter reasons of report.

declaration

 

 

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

This lecture covers strategies for finding the shortest path. We discuss branch and bound, which can be refined by using an extended list or an admissible heuristic, or both (known as A*). We end with an example where the heuristic must be consistent.

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

list
Comments

name

write a comment
TOTAL  0 Comments
* No comments. Please write comments