⟩ Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b
d) Both a & b
Explanation:
RBFE and SMA* will solve any kind of problem that A* can't by using limited amount of memory.
d) Both a & b
Explanation:
RBFE and SMA* will solve any kind of problem that A* can't by using limited amount of memory.
The process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
How many objects are available in closed classes? a) 1 b) 2 c) 3 d) 4
What are the minimum requirements for statr testing?
What is a heuristic function in artificial intelligence algorithms?
What is a cybernetics in artificial intelligence algorithms?
What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned
What is Naive Bayes Algorithm?
The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance what is the length of tour?
What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination
When does an algoritham complete?