SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Intro to AI 1

» Start this Course
(Practice similar questions for free)
Question:

Simulated Annealing

Author: Christian N



Answer:

Escape local maxima by allowing “bad” moves But gradually decrease their size and frequency Origin: adaptation of the Metropolis-Hastings algorithm


0 / 5  (0 ratings)

1 answer(s) in total