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 2652The 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
1848Consider 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
3618Constraint 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
2251Solving 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
2262____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the above
1 3680Post New AI Robotics Questions
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
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
What is prolog used in artificial intelligence?
What is augmented human intelligence?
A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above
Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
What are application domains of computer vision?
What is single agent pathfinding problems?
In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b
Describe the various phases of a robotics life cycle?
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
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 a robot locomotion?
What is 'human-robot interaction'?
In hmm’s, what are the possible values of the variable?
