4. Search: Depth-First, Hill Climbing, Beam
MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course: http://ocw.mit.edu/6-034F10
Instructor: Patrick Winston
This lecture covers algorithms for depth-first and breadth-first search, followed by several refinements: keeping track of nodes already considered, hill climbing, and beam search. We end with a brief discussion of commonsense vs. reflective knowledge.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 4. Search: Depth-First, Hill Climbing, Beam канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-034F10
Instructor: Patrick Winston
This lecture covers algorithms for depth-first and breadth-first search, followed by several refinements: keeping track of nodes already considered, hill climbing, and beam search. We end with a brief discussion of commonsense vs. reflective knowledge.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 4. Search: Depth-First, Hill Climbing, Beam канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
5. Search: Optimal, Branch and Bound, A*Hill Climbing Algorithm & Artificial Intelligence - ComputerphileGenetic Algorithms Explained By ExampleSimulated Annealing - (An Artificial Intelligence Optimization Algorithm)C5W3L03 Beam SearchAndrew Ng - The State of Artificial Intelligence6. Search: Games, Minimax, and Alpha-Beta10. Introduction to Learning, Nearest NeighborsThe wonderful and terrifying implications of computers that can learn | Jeremy Howard12a: Neural Nets1. Artificial Intelligence and Machine Learning12b: Deep Neural NetsGraph Data Structure 6. The A* Pathfinding Algorithm1. Introduction and ScopeUnderstanding Artificial Intelligence and Its Future | Neil Nie | TEDxDeerfieldThe simulated annealing algorithm explained with an analogy to a toyHill Climbing Algorithm | Hill Climbing in Artificial Intelligence | Data Science Tutorial | EdurekaHill Climbing algorithmDouglas Murray in conversation with Jordan Peterson