BFS: Breadth First Search
Автор: Neuro Symbolic
Загружено: 2024-06-21
Просмотров: 388
Описание:
This video is part of our series on classic search algorithms in AI. We review uniformed (i.e., DFS, BFS), informed (A*, heuristic development), and several advanced techniques (e.g., cycle pruning, multipath pruning, bidirectional search).
This video contains slides from David L. Poole and Alan K. Mackworth, Artificial Intelligence: foundations of computational agents, 3rd edition, Cambridge University Press, 2023.
The original slides can be found here: https://artint.info/3e/slides/index.html and are copyright © 2023 David L. Poole and Alan K. Mackworth and are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
About the channel:
The Neuro Symbolic Channel provides the tutorials, courses, and research results on one of the most exciting areas in artificial intelligence and machine learning. With content originally from the AI course taught at Arizona State University, this channel brings you the latest at the intersection of symbolic methods (e.g., logic programming) and deep learning. Learn about the latest algorithms, Python packages, and progress toward larger goals such as artificial general intelligence (AGI).
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
