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).
Many persons are taught AI with the opening line: " The three most important things in AI are representation, representation and representation ". While selecting the method of
In assembly language code lines have two fractions, the earliest one is the name of the instruction which is to be executed, and the next one are the parameters of the command. For
In this technique, the kernel knows about and handles the threads. No runtime system is required in this case. In place of thread table in each process, the kernel has a thread tab
The term ‘page traffic’ describes
Defination of Propositionl logic Predicate logic genertic algorithm Hybrid system Optimization Fuzzy system rules Fuzzy system application
Question (a) A firm produces four products: P , Q , R , and S . Each unit of product P requires two hours of milling, one hour of assembly, and $10 worth of in-process in
Metropolitan Area Networks : These type of networks generally cover specific metropolitan area and provide to them all the services. Wide Area Networks (WANs): Wide Are
I need to review 2 different softwares one is windows based and the other is Linux Based. Please Ask for further details
E-MAIL: Internet has changed the art of writing letters to email. Email is one of the ways on Internet to send messages to another person across the network. E-mail and posta
1. Suppose that the meaning of the BUN instruction of the Basic Computer is changed to implement the relative addressing mode, i.e PC a) Write an optimal operation sequence to im
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