Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Greedy Search - artificial intelligence:
If we have a heuristic function for states, defined as above, so we can simply measure each state with respect to this measure and order the agenda items in terms of the score of the state in the item. However, at each stage, the agent determines which state scores lowest and puts agenda items on the top of the agenda that contain operators acting on that state. In this way, the most promising nodes in a search space are expanded before the less capable ones. This is a nature of best first search is usually called specifically as a greedy search.
In some situations, a greedy search can lead to a solution very quickly. In fact, a greedy search can often go down blind alleys that look promising to start with, but we don't lead to a solution ultimately. Often the best states at the start of a search are in fact really quite poor in comparison to those further in the search space. One way is to counteract this blind-alley effect is to turn off the heuristic until a proportion of the search space has been covered, that the truly high scoring states can be identified. One more problem with a greedy search is, which the agent will have to keep a record of which states have been explored in order to avoid repetitions and ultimately end up in a cycle, so that's why a greedy search must keep all the agenda items it has undertaken in its memory. And also, this search strategy is not optimal, is sense cause the optimal solution may have nodes on the path that score badly for the heuristic function, and hence a non-optimal solution will be found before an optimal one.
Given memory partitions of 100k, 500k, 200k, 300k, and 600k (in order), apply first fit and best fit algorithms to place processes with the space requirement of 212k, 417k, 112k an
Explain the resources of data structure is used by an operating system to keep track of process information? Explain A process is a program in execution. An operating system
what is rowspan and colspan
Voice synthesis Loud speakers and special software are used to output information in the form of sound to help blind and partially-sighted people; it also helps people who have d
What is branch instruction? As a result of branch instruction is a type of instruction which loads a latest values into the program counter.
What is a Multiplexer Tree? Ans Multiplexer Tree: The largest available MUX IC is 16 to 1. Meeting the larger input requires there must be a provision to expand this. It
how mutex work
Sript-Fu is the first GIMP scripting extension. Extensions are split processes that communicate with the GIMP in the similar way that plug-ins do. The distinction is that extension
Make a spreadsheet that has on every line an integer student identification number followed by 3 quiz grades for that student. Go though that information from the spreadsheet into
Q. Illustrate Programming Based on Message Passing? Since we know programming model based on message passing employs high level programming languages such as C/C++ along with a
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd