Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku

0 Answers  

---

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

0 Answers  

---

 What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b

0 Answers  

---

What is hidden markov model (hmms) is used?

0 Answers  

---

What is computer vision?

0 Answers  

---

---

Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

0 Answers  

---

In hidden markov model, how does the state of the process is described?

0 Answers  

---

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 are industrial robots? Explain the various types of industrial robots?

0 Answers  

---

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

0 Answers  

---

Which is used to provide the feedback to the learning element? a) Critic b) Actuators c) Sensor d) None of the mentioned

1 Answers  

---

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  

---