COSC-3112-AI-Lecture-14-Local Search, Optimization Problems, Hill Climbing, Simulated Annealing.
Asslamoalikum! In this lecture local search algorithms and optimization problems are discussed. Details about objective functions is provided. In series of local search algorithms two algorithms have been covered in this lecture which are Hill Climbing & Simulated Annealing.
This video is the property of the Department of Computer Science, Khwaja Fareed UEIT, Rahim Yar Khan, as a part of the initiative for online education by the University.
Copyright © Humaira Anwer, All Rights Reserved. This video is for education purposes only. No part of this video can be copied or reproduced without the prior consent of the publisher.