MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Metaheuristic Optimization Algorithms Research
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

762 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
762 works in the cohort · of 4,299,418page 12 of 16

Labels cover 0 of 762 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 762 of 762 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Optimization of Algorithms with OPAL
Charles Audet, Kien-Cong Dang, Dominique Orban
2012· article· en· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Enhancing Grey Wolf Optimization with Applications and Innovations
Durga Praveen Deevi, Sharadha Kodadi, Himabindu Chetlapalli, Naga Sushma Allur, Koteswararao Dondapati, Thinagaran Perumal
2025· article· en· SN Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
New Exact Methods for Solving Quadratic Traveling Salesman Problem
Yuxiao Chen, Anubhav Pratap Singh, Ryo Kuroiwa, J. Christopher Beck
2025· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Online variance-reducing optimization
Nicolas Le Roux, Reza Babanezhad, Pierre-Antoine Manzagol
2018· article· en· International Conference on Learning Representations· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Table of Contents
Antonio Cortés Castillo, Yi Liu, Bita Fatemipour
2022· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
1
citations
affunlabeled
Block Differential Evolution
Rasa Khosrowshahli, Shahryar Rahnamayan
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Metaheuristics Methods
Vimal Savsani, Ghanshyam G. Tejani, Vivek Patel
2024· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About