Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Problem 8 (JOpoints): Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux a) For

image text in transcribed

Problem 8 (JOpoints): Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux a) For what types of problems will ill climbing woretter than simuadang?In other words, when is the random part of simulated annealing not necessary? b) For what types of problems will randomly guessing the state work just as well as simulated annealing? In other words, when is the hill-climbing part of simulated annealing not necessary? c) Reasoning from your answers to parts (a) and (b) above, for what types of problems is simulated annealing a useful simulated annealing? d) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is annealing schedule is slow e state we visit, is there anything smarter we could do? (e) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.] Problem 8 (JOpoints): Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux a) For what types of problems will ill climbing woretter than simuadang?In other words, when is the random part of simulated annealing not necessary? b) For what types of problems will randomly guessing the state work just as well as simulated annealing? In other words, when is the hill-climbing part of simulated annealing not necessary? c) Reasoning from your answers to parts (a) and (b) above, for what types of problems is simulated annealing a useful simulated annealing? d) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is annealing schedule is slow e state we visit, is there anything smarter we could do? (e) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Practical Database Programming With Visual Basic.NET

Authors: Ying Bai

1st Edition

0521712351, 978-0521712354

More Books

Students also viewed these Databases questions