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
- 0 Answers
- 2212 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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
What is travelling salesman problem?
How logical inference can be solved in propositional logic?
How to send information from the robot sensors to the robot controllers?
Name the basic unit of a robot which can be programmed to give instructions to the robot?
What is the use of the function (copy-list <list>) in lisp?
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
_________________ 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)
Which is the best way to go for game playing problem?
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
Performance Measures are fixed for all agents. State true or false a) True b) False
What are aspects of robotics?
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (197)
- AI AllOther (6)
