Simulated annealing - artificial intelligence, Computer Engineering

Assignment Help:

Simulated Annealing:

One way to get around the problem of local maxima, and related problems like ridges and plateaux in hill climbing is to allow the agent to go downhill to some extent. In virtual annealing - named just because of an analogy with cooling a liquid until it freezes  -  the agent chooses to consider a random move. Whether the move improves the evaluation function that it is always carried out. If the move doesn't improve the evaluation function, so the agent will carry out the move with some probability among of 0 and 1. The probability decreases as the move gets worse in terms of the evaluation function, so really bad moves are rarely carried out. This strategy can often nudge a search out of a local maximum and the search can be continue towards the global maximum.


Related Discussions:- Simulated annealing - artificial intelligence

Difference between the real mode and the protected mode, Problem (a) ...

Problem (a) Explain the difference between the real mode and the protected mode in the 80x86 family of processors. (b) The 32-bit physical address 047C:0048 is to be conv

Sun and nis law, Q. What is Sun and Nis Law? The Sun and Ni's Law is a ...

Q. What is Sun and Nis Law? The Sun and Ni's Law is a simplification of Amdahl's Law and Gustafson's Law. The basic concept underlying Sun and Ni's Law is to find solution to a

Drill-down features provided by abap/4 in interactive lists, What are the d...

What are the drill-down features provided by ABAP/4 in interactive lists? ABAP/4 gives some interactive events on lists such as AT LINE-SELECTION (double click) or AT USER-COM

What are desirable features of an electronic market place, What are the des...

What are the desirable features of an Electronic Market Place? Features of an Electronic Market Place: 1. Its electronic and business center is not a physical building qu

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Show buffered mode for point-to-point message passing, Q. Show Buffered mod...

Q. Show Buffered mode for Point-to-point Message Passing? Buffered mode: Transmitting can be started whether or not matching receives has been started and transmitting may comp

Algebra, Discrete Mathematics - (A?B)-(AnB)=(A-B)?(B-A) - prove by cases?? ...

Discrete Mathematics - (A?B)-(AnB)=(A-B)?(B-A) - prove by cases?? State which law you have used at each step. I''ve just started learning this, this semester .. and i havnt quite

How many services are supported by internet, How many services are supporte...

How many services are supported by internet? The firewall software assists at least Internet services: HTTP, FTP, Gopher, SMTP and Telnet. DNS name resolution, preferably th

Can the size of an array be declared at runtime, Can the size of an array b...

Can the size of an array be declared at runtime?              No, the size of an array can't be declared at run time, we always require to mention the dimensions of an array at

The concept of electronic cash, The concept of electronic cash is to implem...

The concept of electronic cash is to implement payment by Using computers over network

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd