Crowdly
Додати до Chrome
CMPT 380 A - Artificial Intelligence (FA 2025)
Шукаєте відповіді та рішення тестів для CMPT 380 A - Artificial Intelligence (FA 2025)? Перегляньте нашу велику колекцію перевірених відповідей для CMPT 380 A - Artificial Intelligence (FA 2025) в learn.twu.ca.
Отримайте миттєвий доступ до точних відповідей та детальних пояснень для питань вашого курсу. Наша платформа, створена спільнотою, допомагає студентам досягати успіху!
In genetic algorithms, which of the following stages shows mutation?
Which is NOT about the local search algorithms?
There are two heuristic functions (h1 and h2) for the Eight-Puzzle:•h1 = the number of misplaced tiles•h2= the sum of distances of the tiles from their goal positions For the following configuration, h1 = 8 and h2 = 18. Which heuristic function is better?
What should be in the blank for the definition of "being admissible"?
A heuristic h( n ) is admissible if for every node n, ________________, where h*( n ) is the true cost to reach the goal
state from n.
Which is one of the disadvantages (drawback) of the local search algorithms?
Which search algorithm is described by the following?
This search algorithm limits the size of the frontier. It keeps only the knodes with the best f-scores, discarding any other expanded nodes. It is incomplete and suboptimal, but makes good use of available memory. It is used for natural language processing.
Which is NOT one of the informed (heuristic) search strategies?
This is one of the best-first search algorithms. The evaluation function is just a heuristic function (f( n ) = h( n )). It is good ideally, but poor practically since we cannot make sure that a heuristic is good.What is this search algorithm?
Which search strategy (algorithm) takes into account both the past path cost and the estimated future cost (g(n) + h(n))?
Which is NOT one of the ways of the inventing admissible heuristic functions?