模型分类困难的遗传算法求解连续优化问题

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Noel E. Rodríguez-Maya, J. Flores, S. Vérel, Mario Graff
{"title":"模型分类困难的遗传算法求解连续优化问题","authors":"Noel E. Rodríguez-Maya, J. Flores, S. Vérel, Mario Graff","doi":"10.1007/s11047-022-09936-9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":" ","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Models to classify the difficulty of genetic algorithms to solve continuous optimization problems\",\"authors\":\"Noel E. Rodríguez-Maya, J. Flores, S. Vérel, Mario Graff\",\"doi\":\"10.1007/s11047-022-09936-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":49783,\"journal\":{\"name\":\"Natural Computing\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2023-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Natural Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11047-022-09936-9\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11047-022-09936-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 2

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。

Models to classify the difficulty of genetic algorithms to solve continuous optimization problems

Models to classify the difficulty of genetic algorithms to solve continuous optimization problems
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Natural Computing
Natural Computing Computer Science-Computer Science Applications
CiteScore
4.40
自引率
4.80%
发文量
49
审稿时长
3 months
期刊介绍: The journal is soliciting papers on all aspects of natural computing. Because of the interdisciplinary character of the journal a special effort will be made to solicit survey, review, and tutorial papers which would make research trends in a given subarea more accessible to the broad audience of the journal.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信