Tabu Search

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.

[@user-rb2wx2wd7c]

I mean, woo, it is best logic I ever seen in youtube. And his English expression and teaching skill are amazing!

[@markminn01]

To answer the question at the end of the lecture, to approximate p, select two random neighbors of n, evaluate them, and pick the best one, also known as "Tournament selection". This gives good results at low cost.

[@imranh1225]

7:58 - why pan the camera onto the students? Showing them does not add to the quality of the lecture and at the same time breaches their privacy. As we live in times in which such wonderful lectures are increasingly published, we ought to be mindful of these things.

[@shivmahabeer9450]

I really enjoyed this. Great stuff

[@musafir8543]

Thanks sir for Tabu search concept 🙂

[@cyberarmy5342]

hello sir, can you send me program off tabu search?

[@smitasalunkhe9880]

Excellent

[@Ahmed.r.a]

it's fantastic lessons. thank you Prof, thank you NPTEL for sharing learning, I'm looking for Swarm Algorithm, can any one guide me? ____________________________________________

[@rad6403]

10:13 i was afraid for a second when he stared at me and didn't say anything

[@mysticlunala8020]

Bakchodi mt kr lawde

[@rahulchoudhary4652]

It never visits the same state more than once. (It is correct or incorrect)

[@luckmannurhakim9571]

Someone can help me to do this tabu? ;(

[@azizsaouli93]

thank you, can you help me i am loking fo reserche tabou graphe coloration,can you help le please??????

[@adityanehra]

at 22:00 ... he said that value of current node is 27 and best seen in 35 and the node with 40 in disabled..... my question is how can a node with value 40 was disabled if the max value in only 35 till now..... master ji ke kar rahe ho

[@faramarzkhosravi]

+aditya nehra It is possible that such node (the one with 40) has not been visited so far but the bit whose change makes a move from the current node to this node has been very recently changed. No node is explicitly forbidden but the moves are prohibited.

[@DenissSudak]

+Prof_ Gyani what causes confusing is his definition of aspiration criteria. He says "if all allowed are bad..." (21:00) and that doesn't make sense. Neighbour nodes can always be worse than the current node, that's why we are talking about Tabu Search (5:00) in the first place