Interested to Buy Any Domain ? << Click Here >> for more details...
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals
- 1 Answers
- 2843 Views
- I also Faced
- E-Mail Answers
Answer Posted / neer
a) Forward Searching
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is prolog used in artificial intelligence?
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
Give a brief introduction to robotics?
Hill-Climbing algorithm terminates when, a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) Local Min/Max is achieved
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
What brute-force search strategies?
The game of Poker is a single agent. a) True b) False
What are actuators in the robotics?
What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b
What is natural language processing?
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 the use of the microcontroller in the robotics?
What is a difference in robot system and ai programs?
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
