Match List - I with List - II.
b. A* II. Incomplete even if the search space is finite
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (a)-(II), (b)-(IV), (c)-(I), (d)-(III)
Explanation
Greedy best-first search is incomplete even in finite spaces (it can loop); A*'s computation and memory cost is very high; RBFS uses only O(d) space; SMA* is optimal if the optimal solution is reachable within memory, otherwise it returns the best reachable one.
More Artificial Intelligence (AI) questions
- Match List - I with List - II.
- Arrange the following encoding strategies used in Genetic Algorithms (GAs) in the correct sequence starting from the initial step and endin…
- Arrange the following steps in the correct sequence for applying an unsupervised learning technique such as K-means clustering to a data se…
- Given below are two statements: Statement I: Fuzzifier is a part of a fuzzy system Statement II: Inference engine is a part of fuzzy system…
- Match List I with List II. List I: A. Expert system, B. Fuzzy system, C. Operator in genetic algorithm, D. Supervised technique. List II: I…
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Dendral is an expert sys…