Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Difficulties - canonical genetic algorithm:
Therefore the first big problem we face whether designing an "AI" agent to perform a GA-style search is how to represent the solutions. Whether the solutions are textual through nature, so then ASCII strings utilizing eight bits per letter means the size of individuals can get very large. Because of evolution may take thousands of generations to converge onto a solution. Conversely there will be much redundancy in the bit string representations also as: in generally many bit strings produced through the recombination process will not represent solutions at all, like in e.g., they may represent ASCII characters that shouldn't appear in the solution. Whether in the case of individuals that don't represent solutions and how do we measure these with the evaluation function? Further it doesn't necessarily follow like they are entirely unfit, means the tweaking of a single zero to a one might make them good solutions. However the situation is better where the solution space is nonstop or the solutions represent real valued numbers or integers. Hence the situation is worse whereas there are only a finite number of solutions.
But the second big problem we face is how to simplify the evaluation function because this is crucial to the success of the GA experiment. Hence the evaluation function should, whether possible as like:
whether populations have evolved to a certain stage so it is possible to the individuals will all score highly with respect to the evalation function hence all have equal chances of reproducing. In fact in this case, evolution will effectively have stopped plus it may be necessary to take some action to spread them out just to make the evaluation function more difficult dynamically, possibly.
Q. Explain the following: a. BCD code b. Gray code c. Excess-3 code d. True complement method Q. Addition-Subtraction-Multiplication-Division: Perform Binary Addi
Q. Describe about Digital Audio Tape? The most proper tape for backing up data from a disk today is Digital Audio Tape (DAT). It employs a 4mm tape covered in a cartridge. It e
What is micro programmed control? Micro programmed control is a scheme in which control signals are formed by a program same to machine language program.
Truth Tables - artificial intelligence: In propositional logic, where we are limited to expressing sentences where propositions are true or false - we can check whether a speci
When an input signal A=11001 is applied to a NOT gate serially, its output signal is ? Ans. First input applied will be LSB 00110, as A=11001 is serially applied to a NOT gate
There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,
reate a directory "Unix" under your home directory. Command(s): ………………………………………….
Example of Bitwise-AND Operator In the following example, the bitwise-AND operator (&) compares the bits of two integers, nNumA and nNumB: // Example of the bitwise-AND oper
Operand is that part of an instruction which specifies the address of source or result or the data itself on which the processor is to operate. Operand types typically give operand
The result of adding hexadecimal number A6 to 3A is ? Ans. The result will be E0.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd