@IX1 = ACO, 105
@IX1 = ACO modelling, 105
@IX1 = adaptation, 52
@IX1 = adaptive, 692, 650
@IX1 = adaptive control, 696
@IX1 = adaptive evolutionary algorithm, 772
@IX1 = adaptive mutation, 229, 704, 1269
@IX1 = adaptive reconfiguration, 1141
@IX1 = adaptive schemes, 287
@IX1 = aerial spray deposition, 1274
@IX1 = agent behaviors, 97
@IX1 = agent communication, 97
@IX1 = agents, 88
@IX1 = aggregation, 247
@IX1 = algebraic specification, 748
@IX1 = allele distribution, 650
@IX1 = analog hardware, 375
@IX1 = ant algorithm, 43, 105, 74
@IX1 = ant colony optimization (ACO),, 27, 88, 1273
@IX1 = ant colony programming, 133
@IX1 = ant problem, 561
@IX1 = ant programming, 74
@IX1 = ant system, 43, 1317
@IX1 = antenna design, 1133
@IX1 = applicability of evolutionary optimization, 351
@IX1 = application antenna, 1133
@IX1 = application service, 1219
@IX1 = approximation problems, 133
@IX1 = archive of past solutions, 696
@IX1 = archiving, 439
@IX1 = artifical transposons, 561
@IX1 = artificial immune system, 3, 957
@IX1 = artificial intelligence, 888
@IX1 = artificial life, 178
@IX1 = association rules, 399
@IX1 = asynchrony, 134
@IX1 = ATN, 926
@IX1 = atomic clusters, 68
@IX1 = ATPG, 1275
@IX1 = attribute construction, 1268
@IX1 = automatic code generation, 804
@IX1 = automatic programming, 133, 893
@IX1 = automatic software testing, 1233
@IX1 = automatically defined functions, 756, 1383
@IX1 = average computer, 812
@IX1 = Baldwin effect, 52
@IX1 = bargaining game, 121
@IX1 = Bayesian optimization algorithm, 303
@IX1 = behavior programming system, 1298
@IX1 = benchmarking, 520
@IX1 = bioinformatics, 788, 1057, 1272
@IX1 = biological inspiration, 698
@IX1 = bloat, 829
@IX1 = bond graphs, 1073
@IX1 = bunch, 1351
@IX1 = caching, 700
@IX1 = capacity, 1260
@IX1 = case-based reasoning, 1367
@IX1 = cellular automata, 134
@IX1 = charged swarms, 19
@IX1 = CHC, 1212
@IX1 = chess, 740
@IX1 = chess metrics, 973
@IX1 = circuit partitioning, 685
@IX1 = circuits, 877
@IX1 = classification, 952, 1019
@IX1 = classifier system, 920
@IX1 = classifiers, 953
@IX1 = clustering, 678, 1351
@IX1 = code factoring, 1383
@IX1 = co-evolution, 113, 134, 259, 263, 690, 503, 561, 1286
@IX1 = combinatorial optimization, 27, 692, 690, 351
@IX1 = commercial detection, 1212
@IX1 = compact GA, 303
@IX1 = comparison, 952
@IX1 = competent genetic algorithms, 488
@IX1 = competing conventions, 569
@IX1 = competitive coevolution, 113
@IX1 = competitive fitness, 503
@IX1 = complexification, 113
@IX1 = component technology, 1393
@IX1 = composite operators, 1003
@IX1 = computation and evolutionary algorithms, 693
@IX1 = computational circuits, 877
@IX1 = computational effort, 820
@IX1 = computational transgenetics, 1264
@IX1 = concept learning, 748
@IX1 = configuration problem, 11
@IX1 = congressional redistricting, 1262
@IX1 = connection network, 1126, 1259
@IX1 = constrained optimization, 201, 415
@IX1 = constrained problems, 287
@IX1 = constraint handling, 201
@IX1 = convergence, 229
@IX1 = convergence properties, 35
@IX1 = convergence velocity, 210
@IX1 = convolution product, 139
@IX1 = Corewars, 887
@IX1 = corporate failure prediction, 1011
@IX1 = cost distributions, 351
@IX1 = coverage quotient, 658
@IX1 = critical heat flux, 1119
@IX1 = crossover, 456, 1351
@IX1 = cross-validation, 121
@IX1 = cryptanalysis, 139
@IX1 = cultural algorithm, 201
@IX1 = cumulative probability of success, 820
@IX1 = cutting, 1265
@IX1 = cyclic genetic algorithm (CGA), 1286
@IX1 = data, 951
@IX1 = data crawler, 756
@IX1 = data mining, 399, 934, 1019, 1188
@IX1 = deceptive Problems, 488
@IX1 = decision tree, 952
@IX1 = delay, 1260
@IX1 = demes, 88
@IX1 = design automation, 1073
@IX1 = design of experiment (DoE), 11, 1043, 1164
@IX1 = differential equation, 788
@IX1 = digital circuits, 171
@IX1 = digital video, 1212
@IX1 = dissimilar mating, 682, 681
@IX1 = distance between genotypes, 724
@IX1 = distributed computing, 740, 991
@IX1 = distributed genetic algorithms, 953
@IX1 = diversity, 698, 439, 716
@IX1 = diversity maintenance, 520
@IX1 = DNA, 1272
@IX1 = DNA computing, 139
@IX1 = domino convergence, 594
@IX1 = dynamic behavior, 105
@IX1 = dynamic environment, 698, 1383
@IX1 = dynamic networks, 1298
@IX1 = dynamic representation, 703
@IX1 = dynamic search, 19
@IX1 = dynamical system, 642
@IX1 = dynamics, 247
@IX1 = E-cell, 788
@IX1 = efficiency enhancement, 528, 536, 319
@IX1 = effort prediction, 1367
@IX1 = elitism, 439
@IX1 = empirical, 1367
@IX1 = encoding, 407, 892
@IX1 = entropy, 889
@IX1 = epistasis, 544
@IX1 = epochal evolution, 700
@IX1 = equational logic, 748
@IX1 = error, 528, 536
@IX1 = error correction, 877
@IX1 = eugenic, 279
@IX1 = evaluation relaxation, 528, 536
@IX1 = evolution, 279
@IX1 = evolution of evolvability, 1383
@IX1 = evolution of neural networks, 569
@IX1 = evolution parameters, 375
@IX1 = evolution strategies, 229, 247, 553, 740, 1249
@IX1 = evolutionary algorithm, 210, 431, 439, 520, 666, 693, 926, 1065, 1219, 1279, 1297
@IX1 = evolutionary computation, 693, 1113, 1204, 1105, 1264, 1276
@IX1 = evolutionary computation framework, 888
@IX1 = evolutionary design, 780
@IX1 = evolutionary multi-criterion optimization, 431, 520
@IX1 = evolutionary optimization, 201
@IX1 = evolutionary programming, 193, 201
@IX1 = evolutionary reengineering, 155
@IX1 = evolutionary robotics, 1279, 1297
@IX1 = evolutionary software testing, 1329
@IX1 = evolutionary testing, 1233, 1393
@IX1 = evolvable hardware, 178, 163
@IX1 = evolvable optics, 155
@IX1 = evolveable hardware, 171
@IX1 = evolving microcontroller, 178
@IX1 = execution time, 1393
@IX1 = exploitation, 704
@IX1 = exploration, 704
@IX1 = extended compact GA, 303
@IX1 = extinction patterns, 934
@IX1 = failure probability, 193
@IX1 = fair competition principle, 772
@IX1 = fault tolerance, 171, 1260
@IX1 = fault-based testing, 1343
@IX1 = fault-resistance, 134
@IX1 = FCGA, 610
@IX1 = feature extraction, 1249
@IX1 = feature identification, 1249
@IX1 = feature selection, 303, 1019
@IX1 = finite automata, 1272
@IX1 = finite state machine, 189
@IX1 = fitness approximation, 1105
@IX1 = fitness bias, 536
@IX1 = fitness Cases, 889
@IX1 = fitness distance correlation, 724
@IX1 = fitness function, 1329
@IX1 = fitness inheritance, 319
@IX1 = fitness landscape, 686, 812, 1367
@IX1 = fitness sharing, 780
@IX1 = fitness space mapping, 247
@IX1 = fitness variance, 528
@IX1 = fixed channel assignment problem, 1269
@IX1 = fixed point, 642
@IX1 = fixed point analysis, 105
@IX1 = flags, 1359
@IX1 = flexible manufacturing, 1241
@IX1 = flow shop, 1301
@IX1 = flying, 1279
@IX1 = fmGA, 1276
@IX1 = forecasting, 1097
@IX1 = frequency assignment problem, 1269
@IX1 = function approximation, 1119
@IX1 = function optimization, 553
@IX1 = functional test generation, 1275
@IX1 = fuzzy logic, 905
@IX1 = fuzzy preferences, 683
@IX1 = fuzzy rules, 399, 1188
@IX1 = gait generation, 1286
@IX1 = games, 973
@IX1 = GEATbx, 1233
@IX1 = Geiringer Theorem, 868
@IX1 = Geiringer's theorem, 642
@IX1 = gene Dependency, 488
@IX1 = gene order, 610
@IX1 = gene<196>gene interaction, 1150
@IX1 = genepool, 642
@IX1 = generalization, 3
@IX1 = generalization, 303
@IX1 = genetic, 279
@IX1 = genetic algorithm (GA), 68, 88, 155, 263, 287, 327, 335, 343, 375, 415, 456, 480, 488, 544, 561, 586, 594, 602, 626, 650, 658, 678, 685, 691, 692, 694, 696, 697, 698, 700, 888, 1119, 1126, 1150, 1204, 1212, 1241, 1259, 1260, 1264, 1265, 1268, 1271, 1274, 1275
@IX1 = genetic algorithm applications, 1089
@IX1 = genetic algorithm for variable dependence (GAVD), 602
@IX1 = genetic antenna, 1133
@IX1 = genetic diversity, 594
@IX1 = genetic drift, 626
@IX1 = genetic local search, 1301
@IX1 = genetic operators, 697, 698
@IX1 = genetic programming (GP), 133, 155, 716, 724, 740, 756, 772, 780, 804, 812, 853, 868, 887, 889, 890, 892, 894, 1003, 1011, 1043, 1073, 1097, 1196, 1227, 1343, 1383
@IX1 = genetic programming, object oriented, 888
@IX1 = genic distance, 544
@IX1 = genome informatics, 788
@IX1 = genotype to phenotype mapping, 488, 703, 1011
@IX1 = geographic crossover, 407, 689
@IX1 = global convergence, 229
@IX1 = GMDH, 1227
@IX1 = GNP, 890
@IX1 = grammars, 1011
@IX1 = grammatical evolution, 1011
@IX1 = grammatical inference, 189
@IX1 = graph bisection, 43
@IX1 = graph isomorphism, 327
@IX1 = graph partitioning, 43, 686, 685
@IX1 = group method for data handling, 1227
@IX1 = handwritten character recognition, 407
@IX1 = hashing, 700
@IX1 = heuristic, 495, 1265
@IX1 = heuristic searching, 1375
@IX1 = hexagonal tortoise problem, 689
@IX1 = hexapod, 1286
@IX1 = hiearchical topology, 772
@IX1 = hierarchical, 263
@IX1 = hill climbing, 1367, 1375
@IX1 = homologous crossover, 868
@IX1 = human genetics, 1150
@IX1 = human-computer collaboration, 804
@IX1 = hybrid, 692
@IX1 = hybrid algorithms, 1301
@IX1 = hybrid genetic algorithm (GA), 335, 685, 1309
@IX1 = hybrid learning, 952
@IX1 = hyperspectral imaging, 1196
@IX1 = image analysis, 756
@IX1 = image registration, 1249
@IX1 = image segmentation, 1003
@IX1 = immune system, 3, 97
@IX1 = incident detection, 1097
@IX1 = induction, 189
@IX1 = induction of programs, 1343
@IX1 = inductive logic programming, 748, 952
@IX1 = infinite population, 642
@IX1 = information retrieval, 1126
@IX1 = inseparable function interaction, 602
@IX1 = intelligence amplification, 973
@IX1 = intelligent mutators, 561
@IX1 = interactive evolution, 1204
@IX1 = interactive evolutionary design, 951
@IX1 = internal models, 897
@IX1 = internet search engine, 1126
@IX1 = intrusion detection, 3
@IX1 = island model, 991
@IX1 = iterative improvement, 689
@IX1 = iterative refinement, 877
@IX1 = Java, 991
@IX1 = job shop scheduling, 1219
@IX1 = k-cardinality tree problem, 27
@IX1 = keepaway, 1065
@IX1 = keystroke analysis, 957
@IX1 = knapsack problem, 415, 1276
@IX1 = knowledge coevolution, 934
@IX1 = knowledge discovery, 1188
@IX1 = knowledge exploitation, 295
@IX1 = knowledge representation, 121, 934
@IX1 = lack of fit, 1043
@IX1 = latent learning, 897
@IX1 = LeadingOnes, 238
@IX1 = learning, 3, 189, 1105, 1065
@IX1 = learning classifier systems (LCS), 897, 905, 920, 926, 934, 951
@IX1 = learning mechanism, 121
@IX1 = learning rates, 52
@IX1 = learning time, 391
@IX1 = Lennard-Jones problem, 68
@IX1 = lens system design, 155
@IX1 = Levenberg-Marquardt algorithm, 1119
@IX1 = linear fitness, 642
@IX1 = linearizing transformations, 1043
@IX1 = linkage, 544
@IX1 = linkage equilibrium, 642, 868
@IX1 = local heuristic, 335
@IX1 = local search, 1301
@IX1 = location problems, 1262
@IX1 = lock gain, 685
@IX1 = Lotka-Volterra model, 788
@IX1 = machine, 189
@IX1 = machine learning, 953
@IX1 = machine learning, 1019
@IX1 = machine vision, 756
@IX1 = markets, 415
@IX1 = Markov chain, 681
@IX1 = Markov minorization, 812
@IX1 = mate selection, 681, 682
@IX1 = maximum likelihood, 693
@IX1 = mechatronic system, 780, 1073
@IX1 = memetic algorithm, 694
@IX1 = memory, distributed, 295
@IX1 = memory, dynamic, 295
@IX1 = memory, long-term, 295
@IX1 = memory, short-term, 295
@IX1 = Mersenne twister, 311
@IX1 = meta-GA, 295
@IX1 = metaheuristics, 11
@IX1 = metamodelling, 1164
@IX1 = microarray, 610
@IX1 = mineral classification, 1196
@IX1 = mining, 951
@IX1 = mobile agent, 97
@IX1 = mobile unity, 1264
@IX1 = model, 1150
@IX1 = model-based search, 35
@IX1 = modelling, 105, 279, 892
@IX1 = modeling agents, 121
@IX1 = modularization, 1351
@IX1 = MOMGA-II, 1276
@IX1 = motorway traffic modelling, 1097
@IX1 = MPEG-2, 1212
@IX1 = multi objective optimization, 1241
@IX1 = multiagent-based simulation, 121
@IX1 = multicast, 1260
@IX1 = multi-criterion optimization, 431
@IX1 = multimodal functions, 553
@IX1 = multi-objective, 431, 658, 1212, 1260
@IX1 = multi-objective genetic algorithm, 319
@IX1 = multi-objective optimization, 247, 319, 399, 431, 439, 520, 602, 666, 683, 1164, 1301
@IX1 = mutation, 456, 495, 586
@IX1 = mutation analysis, 1343
@IX1 = mutation convergence time, 812
@IX1 = mutation distribution, 247
@IX1 = mutation method, 893
@IX1 = mutation rate, 495
@IX1 = N bit parity, 375
@IX1 = natural crossover, 1309
@IX1 = natural evolution, 1057
@IX1 = natural fractals, 1113
@IX1 = negative selection, 957
@IX1 = network design, 1141
@IX1 = network implementation, 991
@IX1 = network intrusion detection, 3
@IX1 = network routing, 88
@IX1 = network structure, 890
@IX1 = neural network, 113, 163, 375, 391, 407, 569, 905, 1019, 1274
@IX1 = neuroevolution, 113, 569
@IX1 = neuro-genetic hybrids, 407
@IX1 = neuro-model identification, 696
@IX1 = neutral evolution, 893
@IX1 = neutral mutation, 704
@IX1 = neutrality, 704
@IX1 = niching, 626
@IX1 = noise, 528, 536, 1065
@IX1 = noise robustness, 171
@IX1 = noisy fitness function, 694
@IX1 = non-coding regions, 703
@IX1 = non-stationary tasks, 951
@IX1 = non-uniform crossover, 650
@IX1 = normalization, 327
@IX1 = NTRU, 139
@IX1 = numerical approximation, 877
@IX1 = object detection, 1003
@IX1 = object-orientation, 1393
@IX1 = offspring population size, 238
@IX1 = oil recovery, 1264
@IX1 = OneMax, 238, 704
@IX1 = onemax problem, 319
@IX1 = one-to-one marketing, 1259
@IX1 = open-ended tasks, 973
@IX1 = operator bias, 853
@IX1 = operator interaction, 853
@IX1 = operator proportion, 853
@IX1 = optimal mutation rate, 495
@IX1 = optimization, 287, 415, 431
@IX1 = optimization behaviour, 35
@IX1 = optimization problem, 658
@IX1 = optimized interest metric, 1259
@IX1 = option valuation, 74
@IX1 = ordinary differential equations, 1113
@IX1 = packing, 1265
@IX1 = parallel evolutionary algorithms, 772
@IX1 = parallel GAs, 934
@IX1 = parameter optimization, 1274
@IX1 = parameter setting, 495
@IX1 = parameter space, 247
@IX1 = parameter tuning, 11
@IX1 = parametric study, 697
@IX1 = pareto optimal, 431
@IX1 = pareto optimal, evolutionary, 431
@IX1 = pareto optimal set, 666
@IX1 = parsimony pressure, 829
@IX1 = particle swarm optimization, 68, 1227
@IX1 = particle swarms, 19
@IX1 = pattern classification, 399
@IX1 = penalty methods, 287
@IX1 = penetrance function, 1150
@IX1 = perceptual aliazing, 926
@IX1 = performance assessment, 666
@IX1 = performance, agent related, 97
@IX1 = performance evaluation, 311
@IX1 = performance metrics, 520
@IX1 = Perl, 894
@IX1 = phylogenetic tree, 693
@IX1 = phylogenetics, 1057
@IX1 = piston pump, 1264
@IX1 = population diversity, 716
@IX1 = population dynamics, 716
@IX1 = population size, 238
@IX1 = position independence, 488
@IX1 = prediction, 892, 897
@IX1 = prediction modeling, 678
@IX1 = premature convergence, 772, 780
@IX1 = primitives, 804
@IX1 = probabilistics, 193
@IX1 = problem difficulty, 724
@IX1 = problem set up, 804
@IX1 = product design, 1164
@IX1 = program size, 890
@IX1 = proportional GA, 703
@IX1 = proportional representation, 703
@IX1 = prosodic control, 1204
@IX1 = provider, 1219
@IX1 = pseudorandom numbers, 311
@IX1 = PSO, 1227
@IX1 = quality assurance, 1329
@IX1 = quality indicator, 666
@IX1 = quality of service, 1141
@IX1 = racing algorithms, 11
@IX1 = random morphology, 1297
@IX1 = random number generators, 311, 480, 691
@IX1 = random numbers, true, 311
@IX1 = RCBF, 456
@IX1 = reactive taboo search, 1089
@IX1 = readable, 894
@IX1 = real world applications, 1097
@IX1 = real-coded genetic algorithms, 553
@IX1 = real-time, 1393
@IX1 = recommendation, 1259
@IX1 = recommender Systems, 1271
@IX1 = reengineering, 1375
@IX1 = reinforcement learning, 569, 692
@IX1 = reordering, 407, 1119
@IX1 = representation, 27, 35, 703, 1351
@IX1 = reverse engineering, 1375
@IX1 = RGS, 456
@IX1 = rigid transformation, 1249
@IX1 = RoboCup, 1065
@IX1 = robot control, 113
@IX1 = robotics, 804
@IX1 = robustness, 553
@IX1 = rod rolling, 1164
@IX1 = Rosenbrock, 279
@IX1 = royal road, 681, 682
@IX1 = royal trees, 724
@IX1 = rule selection, 399
@IX1 = rule set reduction, 920
@IX1 = rules, 1259
@IX1 = run time analysis, 238
@IX1 = salience, 594
@IX1 = Sammon's mapping, 686
@IX1 = sampling, 193, 238
@IX1 = sampling bias, 553
@IX1 = savings algorithm, 1317
@IX1 = scheduling, 259, 263, 1301
@IX1 = schema theory, 853, 868
@IX1 = schema trace, 686
@IX1 = search, 1286
@IX1 = search heuristics, 1367
@IX1 = search-based software engineering, 1233
@IX1 = selectorecombinative genetic algorithms, 528, 536
@IX1 = self improvement, 893
@IX1 = self-adaptation, 210, 229, 586, 951
@IX1 = self-assembly, 139
@IX1 = semiotic network, 1126
@IX1 = set-partitioning problems, 1262
@IX1 = shellsort, 694
@IX1 = shop floor scheduling, 1273
@IX1 = similar mating, 681, 682
@IX1 = simulated annealing algorithm, 658
@IX1 = simulation, 1150, 1286
@IX1 = slicing, 1359
@IX1 = soccer, 1065
@IX1 = software, 991
@IX1 = software architecture, 1375
@IX1 = software clustering, 1375
@IX1 = software engineering, 888, 1351, 1359, 1383, 1393
@IX1 = software test criteria, 1343
@IX1 = software tools, 888
@IX1 = sorting network, 327, 335
@IX1 = sorting network isomorphism, 327
@IX1 = sorting network optimization, 335, 327
@IX1 = sparse distributed memory, 97
@IX1 = speciation, 569
@IX1 = S-systems, 788
@IX1 = statement/path coverage, 1275
@IX1 = statistical tests, 11
@IX1 = statistics, 650, 889
@IX1 = steady-state GA, 689
@IX1 = steady-state genetic algorithm, 686
@IX1 = stochastic Lyapunov function, 210
@IX1 = strategy adaptation, 391
@IX1 = strategy parameter, 391
@IX1 = structural coverage, 1329
@IX1 = structural testing, 1233
@IX1 = structure optimization, 391
@IX1 = Suk-Jung Choi, 689
@IX1 = symbolic regression, 74, 894, 1043
@IX1 = symmetry, 626
@IX1 = system identification, 1119, 1227
@IX1 = target detection, 756
@IX1 = test automation, 1329
@IX1 = test data generation, 1233
@IX1 = test generation, 1275
@IX1 = test suites, 480
@IX1 = testability, 1359
@IX1 = testing, 1359
@IX1 = theca of a turtle, 689
@IX1 = Tileworld, 890
@IX1 = time series prediction, 1097
@IX1 = time to convergence, 642
@IX1 = topology, 1019, 1073
@IX1 = topology and parameter search, 780
@IX1 = total variation distance, 812
@IX1 = traffic patterns, 1141
@IX1 = transformation, 1359
@IX1 = trap functions, 724
@IX1 = traveling salesman problem, 544, 692, 1262
@IX1 = truss optimization, 1089
@IX1 = TSP, 610
@IX1 = Turing ratio, 973
@IX1 = Turing test, 279, 973
@IX1 = TwoMax problem, 626
@IX1 = UCI datasets, 303
@IX1 = UMDA, 642
@IX1 = underlying graphs, 335
@IX1 = user authentication, 957
@IX1 = variable dependence interaction, 602
@IX1 = variable interaction, 602
@IX1 = variable length genetic algorithms, 868
@IX1 = variable length linear structures, 853
@IX1 = variable plasticity, 52
@IX1 = vehicle routing problem, 690, 1309, 1317
@IX1 = visualization, 594, 686
@IX1 = voice conversion, 1204
@IX1 = Voronoi quantized crossover, 544
@IX1 = Vose theory, 480
@IX1 = Wang tiles, 139
@IX1 = web search improvement, 1126
@IX1 = weighted sum, 683
@IX1 = whitebox testing, 1329
@IX1 = XCS, 920
@IX1 = X-of-N attributes, 1268
@IX1 = Yagi-Uda antenna, 1133