Which method is effective for escaping from local minima?
a) Updating heuristic estimate
b) Reducing heuristic estimate
c) Eliminating heuristic estimate
d) None of the mentioned
Answer Posted / afnan
choise
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
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
What is prolog in ai?
Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku
Mention the difference between statistical ai and classical ai ?
What is 'human-robot interaction'?
Differentiate between the iqbot, metabot and a taskbot?
What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False
Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search
Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
Which is the best way to go for game playing problem?
What does the language of fopl consists of?
What is travelling salesman problem?
What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned
If we wanted to add two number a and b, then how it can be written in lisp language?