Hill-Climbing algorithm terminates when,
a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) Local Min/Max is achieved
No Answer is Posted For this Question
Be the First to Post Answer
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
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
Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b
Differentiate between the iqbot, metabot and a taskbot?
What is natural language processing?
Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
What are benefits of expert systems?
How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4
What is the use of the function (copy-list <list>) in lisp?
If we wanted to add two number a and b, then how it can be written in lisp language?
What are components 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)