CrushSCI.com
提供学术论文选刊润色服务
EVOLUTIONARY COMPUTATION 临时占位封面 计算机科学
返回期刊列表

Review Cycle Records

EVOLUTIONARY COMPUTATION

MIT Press SCIE 非OA
2026新锐 3区2025中科院 3区2025 JCR Q2
255.6平均天数
248中位天数
218最短天数
307最长天数
142025发文量

Paper Review Records

全部论文审稿周期

5 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

218 天

Analysis and Simplification of the Winner of the CEC 2022 Optimization Competition on Single Objective Bound Constrained Search

作者Rafał Biedrzycki

作者单位1. Warsaw University of Technology, Institute of Computer Science, Warsaw, 00-665, Poland [email protected]

PDF源文件 DOI 网页
258 天

Exploring Automated Algorithm Design Synergizing Large Language Models and Evolutionary Algorithms: Survey and Insights

作者He Yu; Jing Liu

作者单位1. School of Artificial Intelligence, Xidian University, 2 South Taibai Road, Xi’an, Shaanxi 710071, China [email protected]; 2. Guangzhou Institute of Technology, Xidian University, Knowledge City, Guangzhou, Guangdong 510555, China; 3. School of Artificial Intelligence, Xidian University, 2 South Taibai Road, Xi’an, Shaanxi 710071, China [email protected]

PDF源文件 DOI 网页
307 天

Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization

作者Maria Laura Santoni; Elena Raponi; Aneta Neumann; Frank Neumann; Mike Preuss; Carola Doerr

作者单位1. Sorbonne Université, CNRS, LIP6, Paris, France [email protected]; 2. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands [email protected]; 3. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia [email protected]; 4. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia [email protected]; 5. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands [email protected]; 6. Sorbonne Université, CNRS, LIP6, Paris, France [email protected]

PDF源文件 DOI 网页
247 天

The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits

作者Carlo Kneissl; Dirk Sudholt

作者单位1. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany [email protected]; 2. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany [email protected]

PDF源文件 DOI 网页
248 天

MO-SMAC: Multiobjective Sequential Model-Based Algorithm Configuration

作者Jeroen G. Rook; Carolin Benjamins; Jakob Bossek; Heike Trautmann; Holger H. Hoos; Marius Lindauer

作者单位1. Data Management & Biometrics, University of Twente, The Netherlands [email protected]; 2. Institute of Artificial Intelligence, Leibniz University Hannover, Germany [email protected]; 3. Machine Learning and Optimisation, Paderborn University, Germany [email protected]; 4. Machine Learning and Optimisation, Paderborn University, Germany [email protected]; 5. Data Management & Biometrics, University of Twente, The Netherlands; 6. Artificial Intelligence Methodology, RTWH Aachen University, Germany [email protected]; 7. ADA Research Group, Leiden University, The Netherlands; 8. University of British Columbia, Canada; 9. Institute of Artificial Intelligence, L3S Research Center Leibniz University Hannover, Germany [email protected]

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。