Interested to Buy Any Domain ? << Click Here >> for more details...
In many problems the path to goal is irrelevant, this class of problems can be solved using,
a) Informed Search Techniques
b) Uninformed Search Techniques
c) Local Search Techniques
d) Only a and b
- 0 Answers
- 2712 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
Differentiate between the iqbot, metabot and a taskbot?
Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned
In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned
Which is used to compressed gasses to drive (power) the robot ?
Suppose I have gmail account, I want to delete all the mails in my inbox having the same name(for eg., Orkut). I have thousands of mails like that. So, how can I delete all the mails having single name. Is there any option provided in gmail?
What do you understand by the term, the robotics?
Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
-
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)
