how we install a artificial intelligence software to our computer ?

0 Answers  

---

Which are necessary for an agent to solve an online search problem? a) Actions b) Step-cost function c) Goal-test d) All of the mentioned

0 Answers  

---

If we wanted to add two number a and b, then how it can be written in lisp language?

0 Answers  

---

What do you understand by the term, the robotics?

0 Answers  

---

Name the basic unit of a robot which can be programmed to give instructions to the robot?

0 Answers  

---

Satellite Image Analysis System is (Choose the one that is not applicable). a) Episodic b) Semi-Static c) Single agent d) Partially Observable

1 Answers  

---

In inductive logic programming what needed to be satisfied?

0 Answers  

---

What brute-force search strategies?

0 Answers  

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---

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

0 Answers  

---

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

1 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  

---