Heuristic search strategies, Computer Engineering

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.

Posted Date: 1/9/2013 7:23:42 AM | Location : United States







Related Discussions:- Heuristic search strategies, Assignment Help, Ask Question on Heuristic search strategies, Get Answer, Expert's Help, Heuristic search strategies Discussions

Write discussion on Heuristic search strategies
Your posts are moderated
Related Questions
What is Priority interrupt. It is a system that establishes a priority over the several resources to determined which condition are to be serviced first when two or more reques

How the production of metal contributes to computer engineering designing?

Design a BCD to excess 3 code converter using minimum number of NAND gates. Hint: use k map techniques. Ans. Firstly we make the truth table: BCD no

Locality of reference implies that the page reference being made by a process is Ans. Locality of reference means that the page reference being made through a process is proba

Q. Explain Cache Organisation? Cache memories are found in nearly all latest computers.  They are very helpful for increasing speed of access of information from memory.  Let's

Explain the Propagation Delay characteristics for digital IC's. Ans: Propagation Delay: - The speed of a digital IC operation is given in terms of propagation delay ti

Object Oriented Analysis and Design 1. What are the advantages of object-oriented systems? 2. Describe the Booch Methodology. 3. Justify that UML is a language for modeli

Determine about the raster-scan systems Most of the present raster-scan systems contain a separate processor called as display processor. This processor performs graphics func

What are the advantages and disadvantages of packet switching over circuit switching? The comparison of packet switching and circuit switching demonstrating advantages and disa

Consider a processor with a 4-stage pipeline. Each  time a conditional branch is encountered, the pipeline must be flushed (3 partially completed instructions are lost). Determine