Question: A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
Options
A : TRUE
B : FALSE
C : -
D : -
Click to view Correct Answer
Local Search Problems and Optimization Problems more questions
The area of AI that investigates methods of facilitating communication....
The characteristics of the computer system capable of thinking, reasoning....
What part of the manufacturing process relate to each stage....
___ algorithm keeps track of k states rather than just....
___ Is an algorithm, a loop that continually moves in....
A genetic algorithm (or GA) is a variant of stochastic....
Hill climbing sometimes called __ because it grabs a good....
Hill-Climbing approach stuck for which of the following reasons?
Searching using query on Internet is, use of ___ type....
Stochastic hill climbing chooses at random from among the uphill....
Constraints Satisfaction Problems more Online Exam Quiz
Informed Search and Exploration