Interested to Buy Any Domain ? << Click Here >> for more details...
What is the space complexity of Greedy search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
- 1 Answers
- 6020 Views
- I also Faced
- E-Mail Answers
Answer Posted / otai
O(bm)
| Is This Answer Correct ? | 9 Yes | 1 No |
Post New Answer View All Answers
In top-down inductive learning methods how many literals are available? What are they?
What do you understand by numerical control?
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What are aspects of robotics?
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
What is ai? Why do we implement ai in the robots?
What is 'human-robot interaction'?
What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b
One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution
What is the degree of freedom in the robotics?
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
What is autonomous robot?
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
List the name of the areas where the robotics can be applied?
What are actuators in the robotics?
