CrushSCI.com
292.2平均天数
253中位天数
218最短天数
475最长天数
142025发文量

Paper Review Records

全部论文审稿周期

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

475 天

Computing Optimal Populations for Binary Problems Using Logic Minimization

作者
Pier Luca Lanzi展开收起
作者单位
1. Politecnico di Milano, Milano, Italy pierluca.lanzi@polimi.it展开收起
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 rafal.biedrzycki@pw.edu.pl展开收起
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 yuhe001@stu.xidian.edu.cn; 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 neouma@mail.xidian.edu.cn展开收起
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 maria-laura.santoni@lip6.fr; 2. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands e.raponi@liacs.leidenuniv.nl; 3. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia aneta.neumann@adelaide.edu.au; 4. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia frank.neumann@adelaide.edu.au; 5. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands m.preuss@liacs.leidenuniv.nl; 6. Sorbonne Université, CNRS, LIP6, Paris, France carola.doerr@lip6.fr展开收起
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 car.kneissl@gmail.com; 2. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany dirk.sudholt@uni-passau.de展开收起
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 j.g.rook@utwente.nl; 2. Institute of Artificial Intelligence, Leibniz University Hannover, Germany c.benjamins@ai.uni-hannover.de; 3. Machine Learning and Optimisation, Paderborn University, Germany jakob.bossek@uni-paderborn.de; 4. Machine Learning and Optimisation, Paderborn University, Germany heike.trautmann@uni-paderborn.de; 5. Data Management & Biometrics, University of Twente, The Netherlands; 6. Artificial Intelligence Methodology, RTWH Aachen University, Germany hh@aim.rwth-aachen.de; 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 m.lindauer@ai.uni-hannover.de展开收起
PDF源文件 DOI 网页

FAQ

EVOLUTIONARY COMPUTATION审稿要多久?

截至2026-11-19,CrushSCI 收录了 EVOLUTIONARY COMPUTATION 的 6 篇完整审稿记录。最快一篇从收稿到录用用了 218 天(Analysis and Simplification of the Winner of the CEC 2022 Optimization Competition on Single Objective Bound Constrained Search,2024-09-05 收稿,2025-04-11 录用),最慢一篇用了 475 天;平均 292.2 天,中位数 253 天。

Expert Matching · Case Demo

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

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

我们会在半小时内回复。

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿59.6 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 leader@crushsci.com

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