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

the best video explaining simulated annealing on KZread. Thanks!

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

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

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

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

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

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

Best of the videos we found on internet, Superb Sir

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

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

beautiful algorithm, beautiful explanation

Best explanation of simulated annealing

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

Very Informative, Thank You Sir

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

Thanks u.This is good lecture that help me.

perfect professor!

Excellent Lecture

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

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.

very nice lecture! Thanks

very nicely expalined sir , thanks

thanks a lot prof, realy

Nice explanation.

Essentially great. Thank you!

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

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

@forrestwargo3173

3 жыл бұрын

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

Thank you so much, Sir

NICE ONE

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

5 жыл бұрын

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

Thank you

As you lower the temperature, the greediness increases.

Thank u sir

No slices..

good

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

too much of camera movement.

Prof. Deepak Khemani, ____/\____

wow. . . respect from pakistan

watch at 2x speed,else it can get boring

He sounds like one of this PC scammers