Interested to Buy Any Domain ? << Click Here >> for more details...
Which method is effective for escaping from local minima?
a) Updating heuristic estimate
b) Reducing heuristic estimate
c) Eliminating heuristic estimate
d) None of the mentioned
- 2 Answers
- 5903 Views
- I also Faced
- E-Mail Answers
Answer Posted / glitter
a) Updating heuristic estimate
| Is This Answer Correct ? | 5 Yes | 0 No |
Post New Answer View All Answers
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False
Give a brief introduction to robotics?
Which was the first industrial robot?
What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent
What is servo controlled robot?
What do you understand by numerical control?
What are application domains of computer vision?
What brute-force search strategies?
What is lisp?
Suppose I have gmail account, I want to delete all the mails in my inbox having the same name(for eg., Orkut). I have thousands of mails like that. So, how can I delete all the mails having single name. Is there any option provided in gmail?
What is artificial intelligence robotics?
What is meant by simulated annealing in artifical intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
What is fopl stands for and explain its role in artificial intelligence?
Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False
