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
Answer Posted / neer
a) Forward Searching
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is hidden markov model (hmms) is used?
for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?
Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above
Give a brief introduction to robotics?
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
Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
What is a robot?
Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned
For building a bayes model how many terms are required?
What is fopl stands for and explain its role in artificial intelligence?
What do you understand by 'humanoid robot'?
Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c