Canonical genetic algorithm - artificial intelligence, Computer Engineering

Canonical Genetic Algorithm:

In such a scenario with all search techniques there one of the first questions to ask along with GAs is how to define a search space that is actually potentially contains good solutions to the problem at hand. Because answering the question of how to represent possible solutions to the problem. But there the classical approach to GAs is to represent the solutions as strings of ones and zero as there in example, bit strings. Further this is not such a bad idea that given to computers store everything as bit strings so then any  solution would ultimately boil down to a string of ones and zeros. Moreover,, there have been many modifications to the original approach to genetic algorithms so and GA approaches here now come in many different shapes and sizes like on higher level representations. Definitely it's possible to see genetic programming, whether the individuals in the population are programs in such a scenario just a GA approach with a more complicated representation scheme. 

However returning to the classical approach, as there example, whether solving a particular problem involved finding a set of five integers between 1 and 100 after then the search space for a GA would be bits strings when the first eight bits are decoded as the first integer so the next eight bits become the second integer and so on. Therefore representing the solutions is one of the tricky parts to using genetic algorithms hence a problem we come back to later. Thus by assuming that the solutions are represented such as strings of length L.

Posted Date: 1/12/2013 6:06:17 AM | Location : United States







Related Discussions:- Canonical genetic algorithm - artificial intelligence, Assignment Help, Ask Question on Canonical genetic algorithm - artificial intelligence, Get Answer, Expert's Help, Canonical genetic algorithm - artificial intelligence Discussions

Write discussion on Canonical genetic algorithm - artificial intelligence
Your posts are moderated
Related Questions
What is MMU? MMU is the Memory Management Unit. It is a special memory control circuit used for executing the mapping of the virtual address space onto the physical memory.

The process which is underlined throughout the check of base data is called as candidate check. When performing candidate check performance varies either towards the positive side

Explain about the MINI COMPUTER Minicomputers are much smaller in size than mainframe computers and they are also less expensive.  The cost of these computers can differ from a

what is meant by risk detection in software project management

Ending transactions: Either side may request that a burst end after the present data phase. Simple PCI component that do not support multi-word bursts will always request this

Remote Login  A login that permits a user terminal to connect to a host computer by a network or direct telecommunications link, and to interact with that host computer as if t

What are interrupts?  Interrupt: An interrupt is a hardware mechanism which enables an external device, classically input/output devices, to send a signal to the CPU. An int

What is skew? Clock Skew: In circuit design, clock skew is a phenomenon within synchronous circuits wherein the clock signal (sent through the clock circuit) arrives at dive

Explain the meaning of LISTEN socket primitive The listen Primitive: After identifying a protocol port a server should instruct the operating system to place a socket

Basic Operational Concepts of a Computer: Most of computer operations are executed in the ALU (arithmetic and logic unit) of a processor. For an example: to add 2 numb