What is Na?ve Bayes Algorithm?2 2094
What is Back propagation in Neural Networks?1 4283
i am a non IT student. answer to the question like why do want to enter to the software line?2 3874
What is a chatterbot?1 2004
What is a trademarkbot?1 2032
Where to find specific information on Search Bots?1 1964
Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)
How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c
Briefly describe 5 ways to do a "table lookup" in SAS.
I need a MATLAB source code to recognize different regular geometric shapes such as: squares,rectangles,triangles,circles and ellipses in different sizes using neural network. All of the images containing these shapes should be in binary format with the size of 300*400 pixels. would you please give me a MATLAB code to detect these geometric shapes?
___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
Fuzzy logic is a form of a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic
What is a shopping bot?
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
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
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
perform para-a,is true?it's perform or not?
What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned
Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution
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