The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
DEAP: a python framework for evolutionary algorithms
Abstract
DEAP (Distributed Evolutionary Algorithms in Python) is a novel volutionary computation framework for rapid prototyping and testing of ideas. Its design departs from most other existing frameworks in that it seeks to make algorithms explicit and data structures transparent, as opposed to the more common black box type of frameworks. It also incorporates easy parallelism where users need not concern themselves with gory implementation details like synchronization and load balancing, only functional decomposition. Several examples illustrate the multiple properties of DEAP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90076-2 · Cited by 780
Cited by
Proceedings of the 19th Python in Science Conference
(2020) · Proceedings of the Python in Science Conference · doi:10.25080/majora-342d178e-02b · Cited by 284
Machine-learning based design of active composite structures for 4D printing
Hamel, C. M., Roach, D. J., Long, K. N., Demoly, F., Dunn, M. L., & Qi, H. J. (2019) · Smart Materials and Structures · doi:10.1088/1361-665x/ab1439 · Cited by 159
Tu, R., Gai, Y. (., Farooq, B., Posen, D., & Hatzopoulou, M. (2020) · Applied Energy · doi:10.1016/j.apenergy.2020.115517 · Cited by 121
Bayesian optimization with known experimental and design constraints for chemistry applications
Hickman, R. J., Aldeghi, M., Häse, F., & Aspuru-Guzik, A. (2022) · Digital Discovery · doi:10.1039/d2dd00028h · Cited by 98
Metadata
- Authors
- De Rainville, F.-M., Fortin, F.-A., Gardner, M.-A., Parizeau, M., & Gagné, C.
- Venue
- Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2012-07-07
- Pages
- 85-92
- OpenAlex
- W2107262494
- Cited by
- 188
- References
- 1
- FWCI
- 2.95
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.