Process of breadth first search, Computer Engineering

Process of Breadth first search:

It's very useful to think of this search as the evolution of the given tree, and how each string of letters of word is found via the search in a breadth first time. The numbers above the boxes specify at which step and why in the search the string was found. 

We see that there each node leads to three others which are connect, which according to this fact that after every step of this procedure, three further steps are may be put on this agenda. This is known as the branching rate of a search to specified, and acutely affects both how long a search is going to be take and why and how much memory it will use up. 

Breadth first search is an almost complete strategy for this kind of search: given enough period and memory for store, it will find a solution if one can exists. Unfortunately, this memory is a big type of problem for breadth first search. We can think for this how big the agenda grows, but in effect we are just counting the number of states which are still 'alive' for this ,  i.e., there are some still steps in the agenda for involving them. As it is clear in the above diagram, that states, which are still alive are those fewer than three arrows coming from them; obviously there are 14 in all. 

It's fairly easy to know that in a search with a branching rate of b, if we really want to search all the way into a depth of d, then the largest number of states will be the agent that will have to store at any one time is bd-1. For example, if our professor wanted to search for all the names up to length 8, than she would have to remember (or write down) 2187 on different strings to complete a breadth in first search. This is just because she would need to remember 37 strings of length 7 in order to be set and able to build all the strings of length 8 from them which are use. In searches with a higher type of branching rate, for the memory requirement can often become too large for an agent's processor as it require.

Posted Date: 1/9/2013 7:19:21 AM | Location : United States







Related Discussions:- Process of breadth first search, Assignment Help, Ask Question on Process of breadth first search, Get Answer, Expert's Help, Process of breadth first search Discussions

Write discussion on Process of breadth first search
Your posts are moderated
Related Questions
Interrupt vector table is always created in first 1K area of the memory. Explain why? When CPU receives an interrupt type number from PIC, it uses this number to look up corres

In 1993 High Performance FORTRAN Forum which is a group of academicians and many leading software and hardware vendors in field of parallel processing established an informal langu

Explain Implementation techniques Implementation techniques(e.g. remote invocation, HTTP). An event-based cooperation can be executed using message passing or it can  be based

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

First-Order Models - Artificial intelligence: We proposed first-order logic like good knowledge representation language rather than propositional logic because it is more expre

Q. What is Assembler? An assembly program is used to transfer assembly language mnemonics to binary code for every instruction after the complete program has been written with

Answering Systems / Database Query There are a large number of opportunities for get faster through parallelizing a Database Management System (DBMS). However, the actual purpo

What are the properties which a data item should possess to implement a critical section? The Critical Section Problem Solution should satisfy the following conditions: 1.

Explain about Flip-Flops  Flip-Flops are also called bistable multivibrator.  A flip-flop is capable of storing 1 bit of binary data.  It has two stable states- 'one' and 'zero

Q. Logic diagrams for same Boolean expression? The expression F can be simplified using Boolean algebra. The logic diagram of simplified expression is drawn in fig (b)