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

Explain the e-cheques verses credit cards in brief, Explain the E-cheques v...

Explain the E-cheques verses Credit Cards in brief. E-cheques: E-cheques are utilized for business dealing into e-commerce. Transactions of such cheques take place onto Inter

Time complexity, Take a look at the code and try to understand the logic, p...

Take a look at the code and try to understand the logic, particularly, the way scrambled words are disambiguated, i.e.., whether they are matched successfully against a correct wor

Explain busy waiting semaphores, Explain busy waiting semaphores. Weak,...

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Truth tables - artificial intelligence, Truth Tables - artificial intellige...

Truth Tables - artificial intelligence: In propositional logic, where we are limited to expressing sentences where propositions are true or false - we can check whether a speci

Graph has a minimum spanning tree already computed, Assume that a graph has...

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

The pre-generated selection screen, With LDB one can change the pre-generat...

With LDB one can change the pre-generated selection screen to their needs Yes with LDB one can alter the pre-generated selection screen.

Risks by financial service provider perspective, What are the risks by fina...

What are the risks by financial service provider's perspective in Electronic Payment Systems? Through the financial service provider's perspective: • Stolen service or c

Illustrate about system memory-management mode, Memory - management mode ...

Memory - management mode System memory-management mode (SMM) is on the same level as protected mode, real mode and virtual mode though it is provided to function as a manager

Simulate a worm propagation considering traffic delay, At time t when an in...

At time t when an infected machine scans and finds a vulnerable machine, the vulnerable one will be compromised and start to scan and infect others at time t+X, where X is a r.v. f

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