Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 2757 Views
- I also Faced
- E-Mail Answers
Answer Posted / neer
a) Forward Searching
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
Constraint satisfaction problems on finite domains are typically solved using a form of ___________. a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) DFS/BFS Search Algorithms
Rational agent is the one who always does the right thing. State true or false a) True b) False
What is the use of the function (copy-list ) in lisp?
Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b
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
Name the basic unit of a robot which can be programmed to give instructions to the robot?
What is natural language processing?
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned
A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
What is a microcontroller? What is the use of the microcontroller in the robotics?
What is computer vision?
What is prolog in ai?
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False
