Optimization - I (Simulated Annealing)

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit nptel.ac.in
To access the translated content:
1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/translation
The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZhSnHsCLML2LXA6
2. Regional language subtitles available for this course
To watch the subtitles in regional languages:
1. Click on the lecture under Course Details.
2. Play the video.
3. Now click on the Settings icon and a list of features will display
4. From that select the option Subtitles/CC.
5. Now select the Language from the available languages to read the subtitle in the regional language.

[@ting-kangpai1580]

the best video explaining simulated annealing on KZbin. Thanks!

[@timzhang1341]

Very good lecture. A prof is a prof, who does so much better lecture than others on KZbin on this Topic.

[@tunahanaktas2655]

This lecture made me understood many fundamentals of SA! Thank you professor!

[@maurocremonini]

Yours is probably the best comprehensive lecture I’ve ever watched, yet simple and clear. Many compliments, professor.

[@BukhtiarMohsin]

Excellent lecture i dont think i need to read anything else now to get the basics of simulated annealing. Bravo

[@jueunhwang783]

Your teaching is excellent. Thank you very much Dr. Khemani!

[@chrisgermann7414]

Thanks a lot for this great lecture. It was a pleasure to listen to you :D. Greetings from Switzerland

[@VivekParashar1979]

Best of the videos we found on internet, Superb Sir

[@mostafakorashy9193]

Really, a great lecture. Many simplified, while deeply explained, concepts. Greetings from Canada

[@rohitgupta025]

Awesome explanation.... very deep but simple one.

[@nilanjansantra3756]

beautiful algorithm, beautiful explanation

[@tamerkhraisha6974]

Best explanation of simulated annealing

[@WinnieThaPoo92]

thank you, wonderful video! i wish you were my professor.

[@sandeepkad5463]

Very Informative, Thank You Sir

[@abdulbasithashraf5480]

What a connection to Genetic algorithms made at the end of the lecture!

[@josbexerr5166]

wow....Excelente... recien entiendo que es un recocido simulado.....gracias.

[@VinhNguyen-kq8jg]

very nice lecture! Thanks

[@FakeNorris]

perfect professor!

[@binxu8117]

Thanks u.This is good lecture that help me.

[@SammyThaSam]

Essentially great. Thank you!

[@jayateertha_d]

very nicely expalined sir , thanks

[@jyotiranjannayak2234]

Excellent Lecture

[@BSplitt]

Great lecture! I do find it funny how often the professor says "essentially" though.

[@malharjajoo7393]

Nice explanation.

[@nirvanfernando280]

thanks a lot prof, realy

[@user-ik3jl5sz1j]

thanks profesor for the explanation, i just want to know if it's the same thing for maxmization and minimization

[@forrestwargo3173]

For anyone still wondering, yes it is. For the most part, min or max and ascent or descent are the same problem

[@prabalshankar4835]

Thank you so much, Sir

[@HarpreetSingh-ke2zk]

Nicely explained Prof. Hope cameraman can focus on the latest written parts rather than move along with lecturer gestures. It is difficult to sync lecture with contents written on board.

[@yogeshkamble2912]

NICE ONE

[@SuganthanHarmless]

Thank you

[@SF-fb6lv]

As you lower the temperature, the greediness increases.

[@lipsachhotray1021]

Sir was saying that initially, the energy gap of AB is easy to overcome than energy gap of CB.So, the algo will go from A to C . But what if we start from C itself?would the algo come down from C to B ? at 41:56

[@atom_productions]

I gs he said that initially its same due to randomness, but in general it has greater tendency to move A 2 C since on cooling the probability of making negative move decreases.47:00

[@soumikpattanayak3225]

Thank u sir

[@shivanartoshy8635]

i need the same but in mathematically solution even in one iteration . who can help???

[@anonymsct]

good

[@raulsebastianriveramartine9821]

No slices..

[@balu9949]

Prof. Deepak Khemani, ____/\____

[@abhinavkumar-ir1od]

Great lecture but moving to complicated stuff first than explaining in simple manner

[@shireeniqbal7399]

wow. . . respect from pakistan

[@soumyabrata111]

too much of camera movement.

[@denniskostjuk]

He sounds like one of this PC scammers

[@mayankguptagmayank1999]

watch at 2x speed,else it can get boring