The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Self-citationHansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
Self-citationThe CMA Evolution Strategy: A Comparing Review
Hansen, N. (2007) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-32494-1_4 · Cited by 1,797
Self-citationProceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,749
Evaluating the CMA Evolution Strategy on Multimodal Test Functions
Hansen, N., & Kern, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_29 · Cited by 758
Self-citationTowards a New Evolutionary Computation
(2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-32494-1 · Cited by 393
Proceedings of the 6th International Conference on Genetic Algorithms
Eshelman, L. J. (1995) · Cited by 355
Parallel Problem Solving from Nature - PPSN III
Davidor, Y., Schwefel, H., & Männer, R. (1994) · Cited by 256
Step-size adaptation based on non-local use of selection information
Ostermeier, A., Gawelczyk, A., & Hansen, N. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_263 · Cited by 199
Self-citationA computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
Igel, C., Suttorp, T., & Hansen, N. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144082 · Cited by 178
Self-citation
Cited by
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
A social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
Li, X., & Yao, X. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2112662 · Cited by 745
Metaheuristics in large-scale global continues optimization: A survey
Mahdavi, S., Shiri, M. E., & Rahnamayan, S. (2015) · Information Sciences · doi:10.1016/j.ins.2014.10.042 · Cited by 465
Efficient Decision-Based Black-Box Adversarial Attacks on Face Recognition
Dong, Y., Su, H., Wu, B., Li, Z., Liu, W., Zhang, T., & Zhu, J. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00790 · Cited by 411
Metadata
- Authors
- Ros, R., & Hansen, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 296-305
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1567473651
- Cited by
- 258
- References
- 14
- FWCI
- 6.95
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. https://app.cochat.ai/papers/10.1007/978-3-540-87700-4_30
- The paper
- Ros, R., & Hansen, N. (2008). A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-87700-4_30
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.