Heuristic search strategies, Computer Engineering

Assignment Help:

Heuristic Search Strategies:

Generally speaking that, a heuristic search is one which have uses a rule of thumb to improve an agent's performance in solving the problems via search. A heuristic search is not to be confused with a heuristic measure. If you can justify a heuristic measure, then it can opens up a range of generic heuristic searches that you can try to improve your agent's performance, as discussed below. It is worth recalling, in fact, that any rule of thumb, for instance, choosing the instruction of operators whenever applied in a simple breadth first search, it is a heuristic. 

In terms of our agenda analogy we can say that, a heuristic search chooses where to put a (state, operator) pair on the agenda that it is proposed as a move in the state space. This choice can be fairly complicated and based on many factors. In terms of the graph analogy, specify that, a heuristic search chooses that node to expand at any point in the search. By proper definition, a heuristic search is not guaranteed to improve performance for a particular problem or set of problems, but they are implemented in the hope of either improving the speed of that a solution is found and or the quality of the solution found. However, we may be able to find optimal solutions that are as good as possible with respect to some measure.


Related Discussions:- Heuristic search strategies

Identify free memory areas in allocation and de-allocations, Name and expla...

Name and explain the popular techniques to identify free memory areas as a result of allocation and de-allocations in a heap. Two well-liked techniques to identify free memory

Html 4.0 element, , an HTML 4.0 element supported by Netscape6 and MSIE, de...

, an HTML 4.0 element supported by Netscape6 and MSIE, defines a set of text which is associated with a specific form element. For illustration, code belo

Instruction issue degree in superscalar processing, Q. Instruction Issue de...

Q. Instruction Issue degree in superscalar processing? The major concept in superscalar processing is how many instructions we are able to issue per cycle. If we are able to is

Eliminating data hazards - computer architecture, Eliminating data hazards:...

Eliminating data hazards: Forwarding NOTE: In the following instance, computed values are in bold, whereas Register numbers are not. Forwarding involves adding output

What are the requirements a dialog program must fulfill, What are the requi...

What are the requirements a dialog program must fulfill? A dialog program must fulfil the following requirements A user friendly user interface. - Format and consistency

What is dynamic modelling, What is Dynamic Modelling  As you know that...

What is Dynamic Modelling  As you know that computer systems are built from the objects which respond to events. External events arrive at boundary of system; you understan

Explain what is meant by a bus, Question: (a) Comment on the general s...

Question: (a) Comment on the general structure of the IAS Computer, illustrate your answer using a diagram. (b) (i) Define CPU time. (a) (ii) A program runs in 10

Safety argument for good design, So far we have considered the problems of ...

So far we have considered the problems of poor ID in terms of the loss of productivity and efficiency to business. There is another important aspect to consider: the issue of safet

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd