Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Q. Explain about Indirect Addressing? In this technique the operand field of instruction specifies the address of address of intended operand for example if instruction LOAD
What is the necessity of an interface? Any device that has to be linked to a CPU requires an interface. This takes care of the mismatch in speed, data and electrical character
What are program-invisible registers? Ans: the local and global descriptor tables are found in the memory system. To access and specify the address of these tables, program inv
What is one-way association? One-way association means association will traverse in only in one direction and implement using the actual implementation. If the multiplicity is
Q. What is a virtual address? Von Neumann had suggested that execution of a program is possible only if program and data are residing in memory. In such a condition program len
Data hazards - computer architecture : A main effect of pipelining is to alter the relative timing of instructions by overlapping their execution. This introduces contro
Differentiate concurrent and parallel executions ? The words "parallel "and "concurrent" are often used interchangeably, however they are different. Parallel execution is connec
Q. Measure of speed in Page or line Printer? Measure of speed relies on whether the printer is a Page Printer or Line. Printer: Let's understand these: Line Printer:
Question (a) Imagine you need to move people through a distance of 10 miles, with the following specifications. • Car: capacity = 5, speed = 60 miles/hour • Bus: capacity
what are advantages and disadvantages of bresenham''s line drawing algorithm?
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd