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

Post New Answer

More AI Robotics Interview Questions

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

0 Answers  


What do you understand by numerical control?

0 Answers  


A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False

1 Answers  


The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) Environment

0 Answers  


List some of the various tools used in robotics?

0 Answers  






What is a robot?

0 Answers  


What types of motors used in industrial robots?

0 Answers  


What are application domains of computer vision?

0 Answers  


The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False

0 Answers  


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

0 Answers  


What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

1 Answers  


What is a difference in robot system and ai programs?

0 Answers  


Categories