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
- 5851 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
Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
What is travelling salesman problem?
Constraint satisfaction problems on finite domains are typically solved using a form of ___________. a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) DFS/BFS Search Algorithms
What is servo controlled robot?
Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
What are expert systems limitations?
List the name of the areas where the robotics can be applied?
What is the future of the robotics?
How logical inference can be solved in propositional logic?
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What is “generality” in ai ?
A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above
What is artificial intelligence robotics?
