Artificial intelligence Which is the most straightforward approach for planning algorithm? Best-first search Hill-climbing search State-space search Depth-first search Best-first search Hill-climbing search State-space search Depth-first search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A.M. turing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence,, Presently, this technique is called Turing Test Boolean Algebra None of these Algorithm Logarithm Turing Test Boolean Algebra None of these Algorithm Logarithm ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Heuristic function h(n) is ________ Cheapest path from root to goal node Estimated cost of cheapest path from root to goal node Average path cost Lowest path cost Cheapest path from root to goal node Estimated cost of cheapest path from root to goal node Average path cost Lowest path cost ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Neural Networks are complex ______________ with many parameters. Nonlinear Functions Exponential Functions Linear Functions Discrete Functions Nonlinear Functions Exponential Functions Linear Functions Discrete Functions ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Where does the Hidden Markov Model is used? Both Speech recognition & Understanding of real world Speech recognition None of the mentioned Understanding of real world Both Speech recognition & Understanding of real world Speech recognition None of the mentioned Understanding of real world ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence The conference that launched the AI revolution in 1956 was held at: New York None of these Dartmouth Harvard Stanford New York None of these Dartmouth Harvard Stanford ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS