Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)最新文献_第2页

Anaconda defeats Hoyle 6-0: a case study competing an evolved checkers program against commercially available software Anaconda以6比0击败Hoyle:一个案例研究，一个进化的跳棋程序与商业软件竞争

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870729

K. Chellapilla, D. Fogel

引用次数: 66

Using multiple representations in evolutionary algorithms 在进化算法中使用多重表示

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870335

T. Schnier, X. Yao

引用次数: 31

Expressing evolutionary computation, genetic programming, artificial life, autonomous agents and DNA-based computing in -calculus-revised version 在微积分修正版中表达进化计算、遗传规划、人工生命、自主代理和基于dna的计算

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870810

E. Eberbach

引用次数: 6

Solving constraint satisfaction problems with heuristic-based evolutionary algorithms 基于启发式进化算法求解约束满足问题

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870843

B. Craenen, A. Eiben, E. Marchiori

引用次数: 29

GA-based kernel optimization for pattern recognition: theory for EHW application 基于遗传算法的模式识别核优化:EHW应用理论

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870344

M. Yasunaga, T. Nakamura, I. Yoshihara, J. Kim

{"title":"GA-based kernel optimization for pattern recognition: theory for EHW application","authors":"M. Yasunaga, T. Nakamura, I. Yoshihara, J. Kim","doi":"10.1109/CEC.2000.870344","DOIUrl":"https://doi.org/10.1109/CEC.2000.870344","url":null,"abstract":"An extension of the kernel-based pattern recognition method using a genetic algorithm is proposed. The method is suited to evolvable pattern recognition hardware using FPGAs. In the conventional method one common kernel function is used in the superposition to make discrimination functions. In the extended method each region of the kernel function is optimized individually. For the kernel-region optimization we use a genetic algorithm to solve a large combinatorial problem almost impossible to solve using any brute-force search. A chromosome represents the kernel region in an n-dimensional pattern space, and each locus corresponds to one of the candidates (genes) for an edge length of the kernel region. We have applied the extended method to a sonar spectrum recognition problem and obtained a recognition accuracy of 83.9%, which is much higher than the 62.0% obtained using the conventional kernel-based method and is also better than 82.7% obtained using the nearest neighbor method and the 83.0% obtained using a neural network (backpropagation algorithm). We have analyzed the individually optimized kernel regions and shown that the GA process automatically extracts features in the patterns and embeds the features in the kernel regions.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130867438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Revisiting Bremermann's genetic algorithm. I. Simultaneous mutation of all parameters 重新审视布雷默曼的遗传算法。1、所有参数同时突变

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870787

D. Fogel, R. Anderson

引用次数: 19

Genetic estimation of competitive agents behavior 竞争代理人行为的遗传估计

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870326

A. Florea

引用次数: 1

Optimization is easy and learning is hard in the typical function 在典型函数中，优化容易，学习困难

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870741

T. M. English

引用次数: 49

Evolutionary optimised ontogenetic neural networks with incremental problem complexity during development 在发展过程中具有增量问题复杂性的进化优化个体发生神经网络

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870823

B. Sendhoff

引用次数: 1

Why the schema theorem is correct also in the presence of stochastic effects 为什么图式定理在随机效应下也是正确的

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI: 10.1109/CEC.2000.870336

R. Poli

{"title":"Why the schema theorem is correct also in the presence of stochastic effects","authors":"R. Poli","doi":"10.1109/CEC.2000.870336","DOIUrl":"https://doi.org/10.1109/CEC.2000.870336","url":null,"abstract":"J. Holland's (1975) schema theorem has been criticised by D.B. Fogel and A. Ghozeil (1997, 1998, 1999) for not being able to correctly estimate the expected proportion of a schema in the population when fitness-proportionate selection is used in the presence of noise or other stochastic effects. This is incorrect for two reasons. Firstly, the theorem in its original form is not applicable to this case. If the quantities involved in schema theorems are random variables, the theorems must be interpreted as conditional statements. Secondly, the conditional versions of Holland and other researchers' schema theorems are indeed very useful to model the sampling of schemata in the presence of stochasticity. In this paper, I show how one can calculate the correct expected proportion of a schema in the presence of stochastic effects when only selection is present, using a conditional interpretation of Holland's schema theorem. In addition, I generalise this result (again using schema theorems) to the case in which crossover, mutation and selection-with-replacement are used. This can be considered as an exact schema theorem that is applicable both in the presence and in the absence of stochastic effects.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115413135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 24