To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

1 Answers  

---

_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)

0 Answers  

---

What are steps to ensure the business stays relevant to the ai revolution?

0 Answers  

---

Performance Measures are fixed for all agents. State true or false a) True b) False

1 Answers  

---

Explain the various types of industrial robots?

0 Answers  

---

Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned

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  

---

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

0 Answers  

---

Is intelligence inherited?

0 Answers  

---

What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned

0 Answers  

---

What do you understand by the term, the robotics?

0 Answers  

---

a) PROLOG b) Java c) LISP d) Perl e) Java script

1 Answers  

---