Effective branching rate - heuristic searches, Computer Engineering

Assignment Help:

Effective Branching Rate:

Assessing heuristic functions is an important part of "AI" research: a particular heuristic function may sound such a good idea, but in practice give no discernible increase in the quality of the search. Search quality can be estimated experimentally in terms of the output from the search, so by using various measures such as the effective branching rate. Let suppose a particular problem P has been solved by search strategy S by expanding N nodes, and the solution play at depth D in the space. Then the effective branching rate of S for P is calculated by comparing S just to a uniform search U. The other example of a uniform search is a breadth first search where the number of branches from any node is always the same (as in our baby naming example). After that we suppose the (uniform) branching rate of U is like that, on the exhausting its search to depth D, it too would have expanded exactly N nodes. That should be imagined branching rate, written b*, is the effective branching rate of S and is calculated thus:

N = 1 + b* + (b*)2 + ... + (b*)D.

Rearranging this equation will give a proper value for b*. For example if we considered that we taken from Russell and Norvig rule, suppose S finds a solution at depth 5 having expanded 52 nodes. As in the above this case:

52 = 1 + b* + (b*)2 + ... + (b*)5.

and it turns out that b*=1.91. To calculate this, we can use the very well known mathematical character:

362_Effective Branching Rate.png
This enables us to write a polynomial for which b* is a zero, and we can solve this using numerical techniques like Newton's method.
It is normally the case that the effective branching rate of a search strategy is similar over all the problems. It is may be used for, so that it is acceptable to average b* over a small set of problems to give a valid account. If there is a heuristic search has a branching rate near to 1, then this is a good sign. We state that one heuristic function h1 dominates another h2 if the search using h1 always has a lower effective branching rate than h2. Having a lower effective branching rate is clearly desirable because it means a quicker search.


Related Discussions:- Effective branching rate - heuristic searches

What is vertical organization and horizontal organization, What is vertical...

What is vertical organization and horizontal organization? Highly encoded schemes that use compact codes to state only a small number of control functions in every microinstruc

Security analysis, Security Analysis: Suppose you are a young securiti...

Security Analysis: Suppose you are a young securities analyst, working in a small brokerage firm. You have access to publicly available information relevant to valuation of th

What is information technology, Information Technology is nothing but the s...

Information Technology is nothing but the study, design, development, execution, support and management of computer based information systems mainly the applications software & har

Name at least six file extensions of microsoft access, Some of the file ext...

Some of the file extensions present in MS Access are ? Access blank project template .adn ? Access database .accdb ? Access Workgroup .mdw ? Access project .adp ? A

Analysis of parallel algorithms, A generic algorithm is mostly analysed on ...

A generic algorithm is mostly analysed on basis of subsequent parameters: the space complexity (amount of space required) and the time complexity (execution time). Generally we giv

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

Explain dns, DNS is The horizontal naming system.

DNS is The horizontal naming system.

What are the data types of the external layer, What are the Data types of t...

What are the Data types of the external layer? The Data types of the external layer are :- ACCP, Char, CLNT, CUKY, CURR, DATS, DESC, FLTP, INT1, INT2, INT4, LANG, LCHR, L

Explain how sap gui handles output screen for the user, Explain how SAP GUI...

Explain how SAP GUI handles output screen for the user. The SAP front-end s/w can either run on the similar computer or on dissimilar computers given for that purpose.  User t

#title, what are the applications of microprogramming

what are the applications of microprogramming

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