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.
how to breadboARD THE 4 BIT COMPARATOR
What is an Interface? An interface is not a class. It is an entity that is explained by the word Interface. An interface has no implementation; it only has the signature or in
Explain Excess 3 Codes Ans. Excess 3 Codes 1. This is the other form of BCD code. All decimal digits are coded in 4 bit binary code. 2. The code for all decimal di
is the time required by a sector to reach below read/write head. Latency Time is the time needed by a sector to reach below read/write head.
Design a game application that plays the children's game of rock, paper, scissors. The user enters a letter indicating a choice. The Math.random method is then used to pick a value
pipelining hazards
How do you create special files like named pipes and device files? The system call method forms special files in the following sequence. Kernel assigns new inode,
DATAFLOW COMPUTING A substitute to the Von Neumann model of calculation is dataflow computation model. In the dataflow model, control is tied to flow of data. Order of instruct
Third Generation (1963-1972) The third generation introduced huge gains in computational power. Innovations in this time include use of integrated circuits or ICs (semiconducto
Explain bit-O-Ring technique. The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routi
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