Virtual University

BIF602 121 Mutation (V-U)

BIF602 120 Crossover (V-U)

BIF602 122 Survivor selection (V-U)

BIF602 123 Initialization and termination (V-U)

BIF602 124 Evolutionary measures (V-U)

BIF602 125 Evolutionary Algorithms (V-U)

BIF602 126 Genetic Algorithms (V-U)

BIF602 128 The goals of optimization (V-U)

BIF602 127 Robustness of traditional search an (V-U)

BIF602 129 Genetic Algorithm and traditional s (V-U)

BIF602 130 Elements of Genetic Algorithms (V-U)

BIF602 131 Genetic Algorithm operators (V-U)

BIF602 132 A simple Genetic Algorithm-I (V-U)

BIF602 133 A simple Genetic Algorithm-II (V-U)

BIF602 135 Genetic Algorithm at work: A simula (V-U)

BIF602 134 Genetic Algorithm at work: A simula (V-U)

BIF602 136 Applications of Genetic Algorithms (V-U)

BIF602 137 Genetic Programming (GP) (V-U)

BIF602 139 Progress in Genetic Programming (V-U)

BIF602 138 Genetic Programming Challenges (V-U)

BIF602 140 Representation in Tree-based Geneti (V-U)

BIF602 141 Initialising the Population for Gen (V-U)

BIF602 142 Selection in Genetic Programming (V-U)

BIF602 144 Getting Ready to Run Genetic Progra (V-U)

BIF602 143 Recombination and Mutation in Genet (V-U)