Generic techniques developed - artificial intelligence, Computer Engineering

Generic Techniques Developed:

In the pursuit of solutions to various problems in the above categories, various individual fundamental techniques have sprung up which have been shown to be helpful for solving a range of problems (usually within the general problem category). These techniques are established enough now to have a name or any kind of symbol and provide at least a partial characterisation of "AI". The following list is not contains to be complete in whole programming, but rather to introduce some techniques you will able to learn later in the course. Assign that some of these overlap with the general techniques above. 

1.       Forward/backward chaining (reasoning)

2.       Defining based (learning) 

3.       Resolution theorem and concept proving (reasoning)

4.       Proof planning (reasoning) 

5.       Constraint satisfaction and self motivation(reasoning)

6.        Davis-Putnam method (reasoning) 

7.       Mini-max search (games)

8.       Alpha-Beta pruning (games) 

9.       Case-based reasoning (expert systems)

10.    Knowledge elicitation (expert systems) 

11.   Neural networks (learning)

12.    Bayesian methods (learning) 

13.   Inductive logic programming (learning)

14.    Reinforcement (learning) 

15.   Genetic algorithms (learning)

16.   Genetic fundamental programming (learning) 

17.   Strips (planning)

18.   N-grams (NLP)

19.   Parsing (NLP)

20.   Behavior based (robotics) 

21.   Cell decomposition (robotics)

Posted Date: 1/9/2013 6:49:03 AM | Location : United States







Related Discussions:- Generic techniques developed - artificial intelligence, Assignment Help, Ask Question on Generic techniques developed - artificial intelligence, Get Answer, Expert's Help, Generic techniques developed - artificial intelligence Discussions

Write discussion on Generic techniques developed - artificial intelligence
Your posts are moderated
Related Questions
Explain about unix file system architecture

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

Q. Explain about Theta Notation? Theta Θ Notation : The set Θ (g(n)) comprises all functions f(n) for that there exist positive constants c1,c2 such that f(n) is squeezed in b

Define Multiprogramming. Multiprogramming: A multiprogramming operating system is system which allows extra than one active user program or part of user program to be store

What are the major functions of IO system?  i. Interface to the CPU and memory by the system bus.  ii. Interface to one or more IO devices by tailored data link.

What is reification? It is the promotion of something that is not an object into an object. Helpful method for Meta applications. It shifts the level of abstraction. Promote

The main I/O used by micro controllers are the parallel ports , the 68HC11F1 has seven  8 bit ports namely Port A,B,C,D,E,F and G . The use of ports depends on the mode configurati

Q. Benefit of digital versatile disk read only memory? The main benefit of having CAV is that individual blocks of data can be accessed at semi-random mode. So head can be move

Q. What are the basic types of Transmission technologies, basis on which computer networks will be categorized? Ans: Broadly there are two kinds of transmission technology:

Explain clearly the four stages in the Rapid Application Development