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
What is an Abstract Data Type (ADT)? Abstract data types or ADTs are a mathematical specification of a set of data and the set of operations that can be done on the data. They

Explain the transport layer in detail. Transport Layer: The transport layer controls and makes sure the end-to-end integrity of the data message propagated by the network am

A. F(X, Y, Z) = ∑(0, 1, 2, 6, 7) using TRUTH TABLE only B. F(X,Y,Z) = ∑ (4,6,7,8) + D(2,5,11,12) using K-Map 1. Find SOP expression 2. Simplify SOP expression 3. Implem

First-Order Logic : There's Reasoning, and then There's Reasoning As humans, we have always prided ourselves on our capability to think things by: to reason things out and c

Define The Karnaugh Maps (K Maps) The Karnaugh map (K map) provides the systematic method for simplifying a Boolean expression or a truth table function when used properly the

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

Remote-load Latency Problem:  When one processor requires some remote loading of data by other nodes, then the processor need to wait for these two remote load operations. The long

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes through every node exactly once. We consider a special case of this problem whe

In SDK – 86 kit 128KB SRAM and 64KB EPROM is provided on system and provision for expansion of another 128KB SRAM is given. The on system SRAM address starts from 00000H and that

Q. Passing Parameters through Stack? The best scheme for parameter passing is through stack. It is also a standard scheme for passing parameters when assembly language is inter