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
No Answer is Posted For this Question
Be the First to Post Answer
What are difficulties in nlu?
for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?
How to send information from the robot sensors to the robot controllers?
What is the use of the microcontroller in the robotics?
Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
What is the function of the third component of the planning system?
For building a bayes model how many terms are required?
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
What is a robot locomotion?
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
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
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)