073 Tabu search introduction | Computer Monk 🔴

Поделиться
HTML-код
  • Опубликовано: 24 дек 2024

Комментарии • 9

  • @anavchug2140
    @anavchug2140 2 года назад +2

    Thank you for this. I took a course and the instructor was explaining this concept so bad. Really appreciate this !!

  • @prakharjaiswal5774
    @prakharjaiswal5774 2 месяца назад

    U saved my sem🎉

  • @razvanefros411
    @razvanefros411 7 месяцев назад

    so the aspiration criteria allows the algorithm to pick an already visited solution as the global optima, if it is the best one it could find and all other allowed moves are worse

  • @OGfromGst
    @OGfromGst 3 года назад +2

    Nice one dude

  • @marco.nascimento
    @marco.nascimento 3 года назад

    Nice explanation, thanks!

  • @yourakshith
    @yourakshith 2 года назад

    what happens if we apply the method what we did at local optima to the global maximum?

  • @ishityle
    @ishityle 2 года назад

    Super nice

  • @imran7TW
    @imran7TW 7 месяцев назад

    thx..