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
In hidden markov model, how does the state of the process is described?
Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution
Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators
Rational agent is the one who always does the right thing. State true or false a) True b) False
What are the capabilities of expert systems?
What is artificial intelligence robotics?
What is ai? Why do we implement ai in the robots?
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
Name some expert system technology?
Which of the following algorithm is online search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned
Categorize Crossword puzzle in Fully Observable / Partially Observable. a) Fully Observable b) partially Observable
What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b
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)