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, as defined above, then we may simply measure each state with respect to this measure and order the plan items in terms of the score of the state in the item. So, at every stage, the agent determines which state scores lowest and puts agenda items on the top of the plan which contain operators acting on that state. Like this, the most promising nodes in a search space are expanded before the less promising ones. This is a type of best first search known particularly as a greedy search.
In some situations, a greedy search may lead to a solution very rapidly However, a greedy search can frequently go down blind alleys that look promising to start with, but ultimately don't lead to a solution. Often the best states at the beginning of a search are actually really quite poor in comparison to those further in the search space. One way to counteract this blind-alley effect is to turn off the heuristic until a amount of the search space has been enclosed, so that the truly high scoring states can be identified. Another problem with a greedy search is that 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 greedy search might keep all the agenda items it has undertaken in its memory. Also, this search method is not optimal, because the optimal solution can have nodes on the path which score faultily for the heuristic function, and thus a non-optimal solution will be found before an optimal one. (Remember that the heuristic function only estimates the path cost from a node to a solution).
THE FIRST GENERATION (1949-1955) The computers in this generation have the following characteristics: Physically large in size Inflexible in operations
Memory Management: The purpose of the memory management system is to load programs into memory in such a way as to give each program loaded the memory that it requires for
G e ne ric Techniques Developed: In the pursuit of solutions to many problems in the above categories, serval specific techniques have sprung up which have bee
Question 1 Write down the Booth's Multiplication Algorithm. Justify the Booth's Multiplication Algorithm Question 2 Explain the functions of ALU Question 3 Define the term ins
Database Management Software: For storage of large amounts of varied data, and rapid retrieval and interpretations of data, the database is the ideal tool. It is most useful for s
flowchart that display yhe students average scores for 3 quizzes.Assume that there are 3 sections having 5 student each.Valid number is 1-100 for the quizzes.Enter an invalid numbe
Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a
Sets of individual statements making up a single code block are known as suites in Python. Composite or complex statements for example if, def while and class are those which neces
I would like to know how to write a program for a 8086 microprocessor in ALP to find 10''s complement of a packed BCD number.
Message Quality and Quantity: Quality of transmission is a very important .consideration in telecommunication. Voice communication can use a narrow bandwidth, which means the
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