Paper Review Records
全部论文审稿周期
6 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
475
天
218
天
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展开收起
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展开收起
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展开收起
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展开收起
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 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
