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).
Two-tiered architecture: This approach basically introduced a database server to replace the file server. The emergence of relational database management systems and graphica
What is meant by the terms 'row-major order' and 'column-major order'? Ans: (i) Storing the array column by column is called as column-major order and storing the array row by
When purchasing a database program, you must have a clear idea of what you need it for. Ask yourself the following questions. (1) Will it perform all (he operations necessary f
construct a tree where preorder is ABCDFGE
What is methods For handling Deadlocks?
Pebble Merchant Problem Description There is a pebble merchant. He sells the pebbles, that are used for shining the floor. His main duty is to take the length of the room’s sides.
number of 4 to 16 line decoders required to get 8 lto 256 line decoder
scope of operation research in science?
what is the computer science
tell me formulas
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